|
Search: id:A165549
|
|
|
| A165549 |
|
a(1) = 7; for n > 1, a(n) = smallest prime strictly greater than sum of previous terms. |
|
+0
1
|
|
| 7, 11, 19, 41, 79, 163, 331, 653, 1307, 2617, 5231, 10463, 20929, 41863, 83717, 167437, 334877, 669763, 1339523, 2679037, 5358083, 10716163, 21432317, 42864671, 85729367, 171458671, 342917357, 685834729, 1371669443, 2743338881
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
a=7; b=11; s=a+b; lst={a, b}; Do[i=1; While[ !PrimeQ[s+i], i++ ]; c=s+i; AppendTo[lst, c]; a=b; b=c; s+=c, {n, 2*4!}]; lst
|
|
PROGRAM
|
(PARI) {m=30; s=0; v=vector(m); v[1]=7; for(n=2, m, s+=v[n-1]; v[n]=nextprime(s+1)); v} [From Klaus Brockhaus, Sep 25 2009]
|
|
CROSSREFS
|
Cf. A064934, A070218.
Sequence in context: A032672 A133425 A038984 this_sequence A055939 A154555 A162857
Adjacent sequences: A165546 A165547 A165548 this_sequence A165550 A165551 A165552
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 21 2009
|
|
EXTENSIONS
|
Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Sep 25 2009
|
|
|
Search completed in 0.002 seconds
|
