Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070218
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070218 a(1) = 2; a(n) = smallest prime greater than the sum of all previous terms. +0
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; listen)
OFFSET

1,1

COMMENT

Grows exponentially: Ceiling[Log[2,a(n)]//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)

CROSSREFS

Sequence in context: A113823 A113843 A113884 this_sequence A048456 A071899 A102644

Adjacent sequences: A070215 A070216 A070217 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research