editing
approved
editing
approved
Gilles A. Fleury, <a href="/A143192/b143192.txt">Table of n, a(n) for n = 0..1500</a>
approved
editing
proposed
approved
editing
proposed
_Gilles A. Fleury (gilles.fleury(AT)supelec.fr), _, Oct 18 2008, Mar 06 2009
approved
editing
Gilles A. Fleury, <a href="/A143192/b143192.txt">Table of n, a(n) for n=0..1500</a>
nonn,new
nonn
1,0,1
Asymptotically the sequence tends to 66 67 (what is the first n for which a(n)=66 ? 67 is n<=10000 for sure... to be found !1042).
Gilles A. Fleury, <a href="b143192.txt">Table of n, a(n) for n=0..1500</a>
nonn,new
nonn
Gilles A. Fleury (gilles.fleury(AT)supelec.fr), Oct 18 2008, Mar 06 2009
a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5, n+6, n+7 and the operators +, -, *, /, using each number only once.
1413, 7187, 12421, 22751, 28862, 48046, 36094, 46372, 54214, 72845, 88119, 107246, 125589, 104153, 43838, 45893, 55054, 62090, 66226, 70187, 69638, 74941, 85303, 81913, 68891, 77237, 37997, 48758, 42827, 45554, 22217, 26617, 29422, 29099
1,1
nonn
Gilles A. Fleury (gilles.fleury(AT)supelec.fr), Oct 18 2008
approved