cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 4, 8, 12, 18, 24, 32, 40, 49, 59, 71, 83, 97, 111, 126, 142, 160, 178, 198, 218, 239, 261, 285, 309, 334, 360, 387, 415, 445, 475, 507, 539, 572, 606, 641, 677, 715, 753, 792, 832, 874, 916, 960, 1004, 1049, 1095, 1143, 1191, 1240, 1290, 1341, 1393, 1447
Offset: 1

Views

Author

James C. McMahon, Jul 08 2024

Keywords

Crossrefs

Partial sums of A014683.

Programs

  • Mathematica
    Table[n(n+1)/2+PrimePi[n],{n,53}]
  • PARI
    a(n) = n*(n+1)/2 + primepi(n); \\ Michel Marcus, Jul 31 2024

Formula

a(n) = A000217(n) + A000720(n).
a(1) = 1; for n > 1: a(n) = a(n-1) + n + A010051(n).