login
a(n) = a(n-2) + prime(n-1) for a(0) = a(1) = 0.
1

%I #27 Dec 04 2023 09:55:26

%S 0,0,2,3,7,10,18,23,35,42,58,71,89,108,130,151,177,204,236,265,303,

%T 336,376,415,459,504,556,605,659,712,768,825,895,956,1032,1095,1181,

%U 1246,1338,1409,1505,1582,1684,1763,1875,1956,2072,2155,2283,2378,2510

%N a(n) = a(n-2) + prime(n-1) for a(0) = a(1) = 0.

%H Paolo Xausa, <a href="/A355726/b355726.txt">Table of n, a(n) for n = 0..10000</a>

%F a(2*n) = A077131(n), for n>=1.

%F a(2*n+1) = A077126(n), for n>=1.

%t Join[{0},Accumulate[FoldList[#2-#1&,0,Prime[Range[100]]]]] (* _Paolo Xausa_, Dec 04 2023 *)

%Y Cf. A077131 (even bisection), A077126 (odd bisection).

%Y Cf. A008347 (first differences), (-1)^n*A330547 (second differences).

%K nonn

%O 0,3

%A _Paul Curtz_, Jul 15 2022