login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070218 a(1) = 2; a(n) = smallest prime greater than the sum of all previous terms. 5
2, 3, 7, 13, 29, 59, 127, 241, 487, 971, 1949, 3889, 7789, 15569, 31139, 62297, 124577, 249181, 498331, 996689, 1993357, 3986711, 7973419, 15946841, 31893713, 63787391, 127574789, 255149591, 510299171, 1020598339, 2041196683 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Grows exponentially: ceiling(log_2(a(n))) = n. - Labos E. (labos(AT)ana.sote.hu), May 08 2002

MATHEMATICA

tb[0]={} tb[x_] := Union[tb[x-1], m[x]] m[x_] := {Prime[1+PrimePi[Apply[Plus, tb[x-1]]]]} Flatten[Table[m[w], {w, 1, 10}]] (Labos)

bb={2}; s=2; Do[p=Prime[PrimePi[s]+1]; s=s+p; bb=Append[bb, p], {k, 32}]; bb (Seidov)

Nest[Append[#, NextPrime[Total[#]]]&, {2}, 30] (* Moshe Levin, Oct 28 2011 *)

PROG

(PARI) print1(s=2); for(n=2, 99, print1(", "t=nextprime(s+1)); s+=t)

CROSSREFS

Sequence in context: A113843 A199582 A113884 * A048456 A071899 A102644

Adjacent sequences:  A070215 A070216 A070217 * A070219 A070220 A070221

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 01 2002

EXTENSIONS

More terms from Labos E. (labos(AT)ana.sote.hu), May 08 2002

Corrected by Zak Seidov (zakseidov(AT)yahoo.com), May 21 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.