|
| |
|
|
A071115
|
|
a(1) = 1; a(n+1) is the smallest integer >=0 that cannot be obtained from the integers {a(1), ..., a(n)} using each number at most once and the operators +, -, *, /.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| G. Bannay, LE COMPTE EST BON
Index entries for similar sequences
|
|
|
EXAMPLE
| a(4)=11 because we can write 4+1=5, 4+2=6, 4+2+1=7, 4*2=8, 4*2+1=9, (4+1)*2=10 by using 1, 2 and 4 but we cannot do the same thing for 11.
|
|
|
CROSSREFS
| Cf. A060315.
Sequence in context: A082104 A099215 A089407 * A156809 A076317 A076318
Adjacent sequences: A071112 A071113 A071114 * A071116 A071117 A071118
|
|
|
KEYWORD
| hard,more,nonn
|
|
|
AUTHOR
| Koksal Karakus (karakusk(AT)hotmail.com), May 27 2002
|
| |
|
|
