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.

A110895 a(n) = a(n-1) + 1 + prime(n), with a(1) = 1.

Original entry on oeis.org

1, 4, 8, 14, 22, 34, 48, 66, 86, 110, 140, 172, 210, 252, 296, 344, 398, 458, 520, 588, 660, 734, 814, 898, 988, 1086, 1188, 1292, 1400, 1510, 1624, 1752, 1884, 2022, 2162, 2312, 2464, 2622, 2786, 2954, 3128, 3308, 3490, 3682, 3876, 4074, 4274, 4486, 4710
Offset: 1

Views

Author

G. L. Honaker, Jr., Sep 20 2005

Keywords

Comments

The number of integers between a(n) and a(n+1) exclusive equals the n-th prime.

Crossrefs

Cf. A060939.

Programs

  • Mathematica
    RecurrenceTable[{a[n]==a[n-1]+Prime[n]+1,a[0]==1},a,{n,50}]  (* Harvey P. Dale, Apr 22 2011 *)

Formula

a(n) = A060939(n-1) + 1. - Alan Michael Gómez Calderón, Dec 16 2024

Extensions

More terms from Harvey P. Dale, Apr 22 2011