cp's OEIS Frontend

A096279 Sums of successive sums of successive sums of successive sums of successive primes.

%I A096279 #14 Oct 31 2023 18:43:17
%S A096279 83,122,168,216,264,316,378,446,514,582,644,700,766,846,924,994,1062,
%T A096279 1126,1188,1258,1340,1434,1528,1602,1656,1704,1764,1860,1984,2094,
%U A096279 2178,2260,2348,2432,2514,2598,2682,2766,2848,2932,3018,3090,3152,3242,3378
%N A096279 Sums of successive sums of successive sums of successive sums of successive primes.
%C A096279 The first term is always odd and may be prime. The first terms of more and more successions produce A007443.
%H A096279 Seiichi Manyama, <a href="/A096279/b096279.txt">Table of n, a(n) for n = 1..10000</a>
%e A096279 2 3 5 7 11 successive primes
%e A096279 5 8 12 18 sums of successive primes
%e A096279 13 20 30 sums of successive sums of successive primes
%e A096279 33 50 sums of successive sums of successive sums of successive primes
%e A096279 83 sums of successive sums of successive sums of successive sums of successive primes
%t A096279 Nest[ListConvolve[{1,1},#]&,Prime[Range[100]],4] (* _Paolo Xausa_, Oct 31 2023 *)
%o A096279 (PARI) \\ Iterated successive sums of successive sums... of successive primes.
%o A096279 \\ Input number of terms n and the order m. m=0 yields the primes.
%o A096279 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], ", "); ) }
%Y A096279 Cf. A000040, A001043, A096277, A096278.
%K A096279 easy,nonn
%O A096279 1,1
%A A096279 _Cino Hilliard_, Jun 22 2004