The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 +, -, *, /. 1
 1, 2, 4, 11, 34, 152, 1007, 7335, 85761, 812767 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. Bannay, LE COMPTE EST BON 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: A089407 A289588 A238425 * A217043 A249696 A156809 Adjacent sequences:  A071112 A071113 A071114 * A071116 A071117 A071118 KEYWORD hard,more,nonn AUTHOR Koksal Karakus (karakusk(AT)hotmail.com), May 27 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 17 18:52 EDT 2021. Contains 343070 sequences. (Running on oeis4.)