login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A374426 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 7 02:35 EDT 2024. Contains 375728 sequences. (Running on oeis4.)