A283462 Prime summand recurrence: a(n+1) = the sum of the primes <= a(n) with a(0) = 3.

3, 5, 10, 17, 58, 381, 12718, 9024109, 2626688611773, 122821324737555729064487

Offset

0,1

Comments

Obviously beginning with any number less than 3 goes nowhere.

Employed Kim Walisch's primesum.

Links

Table of n, a(n) for n=0..9.

Mathematica

NestList[Sum[Prime@ i, {i, PrimePi@ #}] &, 3, 8] (* Michael De Vlieger, Mar 09 2017 *)

Prog

(PARI) a(n) = if(n==0, 3, sum(k=1, primepi(a(n-1)), prime(k))); \\ Indranil Ghosh, Mar 13 2017

Crossrefs

Subsequence of A007504.

Sequence in context: A366108 A096395 A026687 * A270414 A227208 A009854

Adjacent sequences: A283459 A283460 A283461 * A283463 A283464 A283465

Keyword

hard,nonn

Author

Robert G. Wilson v, Mar 08 2017

Status

approved