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!)
 A034692 a(n+1) = smallest number that is not the sum of a(n) or fewer terms of a(1),...,a(n). 0
 1, 2, 5, 23, 455, 197447, 38895873863, 1512881323770591465287, 2288809899755012359449577849239960517955399, 5238650757216549725917660910593720468102050623548424798300898740084824366637074960199 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n+1)=a(n)^2+2*a(n)-a(n)*a(n-1)-a(n-1), n>1. MATHEMATICA RecurrenceTable[{a[1]==1, a[2]==2, a[n]==a[n-1]^2+2a[n-1]- a[n-1] a[n-2]- a[n-2]}, a, {n, 10}] (* Harvey P. Dale, Dec 24 2014 *) CROSSREFS Sequence in context: A158889 A181074 A078125 * A002507 A137094 A209866 Adjacent sequences:  A034689 A034690 A034691 * A034693 A034694 A034695 KEYWORD nonn AUTHOR EXTENSIONS Formula and more terms from Christian G. Bower. 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 May 17 10:57 EDT 2021. Contains 343971 sequences. (Running on oeis4.)