login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = n*(n + 1)/2 + pi(n), where pi(n) = A000720(n) is the prime counting function.
1

%I #15 Jul 31 2024 09:09:03

%S 1,4,8,12,18,24,32,40,49,59,71,83,97,111,126,142,160,178,198,218,239,

%T 261,285,309,334,360,387,415,445,475,507,539,572,606,641,677,715,753,

%U 792,832,874,916,960,1004,1049,1095,1143,1191,1240,1290,1341,1393,1447

%N a(n) = n*(n + 1)/2 + pi(n), where pi(n) = A000720(n) is the prime counting function.

%H James C. McMahon, <a href="/A374426/b374426.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A000217(n) + A000720(n).

%F a(1) = 1; for n > 1: a(n) = a(n-1) + n + A010051(n).

%t Table[n(n+1)/2+PrimePi[n],{n,53}]

%o (PARI) a(n) = n*(n+1)/2 + primepi(n); \\ _Michel Marcus_, Jul 31 2024

%Y Cf. A000217, A000720, A010051, A256885.

%Y Partial sums of A014683.

%K nonn

%O 1,2

%A _James C. McMahon_, Jul 08 2024