OFFSET
1,1
COMMENTS
The first term is always odd and may be prime. The first terms of more and more successions produce A007443.
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000
EXAMPLE
2 3 5 7 11 successive primes
5 8 12 18 sums of successive primes
13 20 30 sums of successive sums of successive primes
33 50 sums of successive sums of successive sums of successive primes
83 sums of successive sums of successive sums of successive sums of successive primes
MATHEMATICA
Nest[ListConvolve[{1, 1}, #]&, Prime[Range[100]], 4] (* Paolo Xausa, Oct 31 2023 *)
PROG
(PARI) \\ Iterated successive sums of successive sums... of successive primes.
\\ Input number of terms n and the order m. m=0 yields the primes.
sucsums(n, m) = { my(a, b, i, j, k); a = primes(n+m); b = vector(#a); for(i=1, m, for(j=1, n+m-i, b[j] = a[j]+ a[j+1]; ); a=b; ); for(k=1, n, print1(a[k], ", "); ) }
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Jun 22 2004
STATUS
approved