|
Search: id:A060315
|
|
|
| A060315 |
|
a(1)=1; a(n) is the smallest positive integer that cannot be obtained from the integers {0, 1, ..., n-1} using each number at most once and the operators +, -, *, /. |
|
+0
14
|
|
| 1, 2, 4, 10, 29, 76, 284, 1413, 7187, 38103, 231051
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
G. Bannay, LE COMPTE EST BON (to obtain a(4)=10 for example, enter ceb -a4 -x1 0 1 2 3)
Index entries for similar sequences
|
|
EXAMPLE
|
For n=4 we have {0,1,2,3} to play with, and we can get 6=2*3, 7=2*3+1, 8=2*(1+3), 9=3*(1+2), but we cannot get 10, hence a(4) = 10.
|
|
CROSSREFS
|
Cf. A060316.
Sequence in context: A006841 A003223 A061417 this_sequence A005505 A135334 A000995
Adjacent sequences: A060312 A060313 A060314 this_sequence A060316 A060317 A060318
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Jean-Marc Rebert (jm.rebert(AT)calixo.net), Mar 28 2001
|
|
EXTENSIONS
|
More terms from Koksal Karakus (karakusk(AT)hotmail.com), May 26 2002
|
|
|
Search completed in 0.002 seconds
|
