|
| |
|
|
A109277
|
|
Slowest increasing sequence: a(n) is a prime closest to the sum of all previous terms.
|
|
2
| |
|
|
2, 2, 3, 7, 13, 29, 53, 109, 223, 439, 881, 1759, 3517, 7039, 14071, 28151, 56299, 112601, 225217, 450413, 900821, 1801669, 3603317, 7206631, 14413253, 28826519, 57653027, 115306073, 230612149, 461224289, 922448587, 1844897167, 3689794321
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Cf. A109277 fastest increasing sequence.
|
|
|
EXAMPLE
| a(1)=2, sum(1)=2; prime closest to sum is 2, hence a(2)=2, sum(2)=4; there are two primes 3 and 5 closest to sum(2), we choose the smallest one, hence a(3)=3, sum(3)=7, etc.
|
|
|
MATHEMATICA
| s={2}; su=2; Do[If[PrimeQ[su], a=su, pp=PrimePi[su]; prv=Prime[pp]; nxt=Prime[pp+1]; a=If[su-prv>nxt-su, nxt, prv]]; AppendTo[s, a]; Print[a]; su+=a, {i, 42}]; s
|
|
|
CROSSREFS
| Cf. A109278.
Sequence in context: A167348 A068524 A184841 * A093437 A060357 A064714
Adjacent sequences: A109274 A109275 A109276 * A109278 A109279 A109280
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Zak Seidov (zakseidov(AT)yahoo.com), Jun 25 2005
|
| |
|
|
