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.

Showing 1-1 of 1 results.

A093503 a(0) = 2, a(n) = least prime >= a(n-1) + n.

Original entry on oeis.org

2, 3, 5, 11, 17, 23, 29, 37, 47, 59, 71, 83, 97, 113, 127, 149, 167, 191, 211, 233, 257, 281, 307, 331, 359, 389, 419, 449, 479, 509, 541, 577, 613, 647, 683, 719, 757, 797, 839, 881, 929, 971, 1013, 1061, 1109, 1163, 1213, 1277, 1327, 1381, 1433, 1487, 1543
Offset: 0

Views

Author

Amarnath Murthy, Apr 17 2004

Keywords

Comments

A variant with offset 1 is 2, 5, 11, 17, ... which agrees with this sequence for n > 1.

Examples

			a(6) is the least prime >= a(5) + 6 = 23 + 6 = 29, hence a(6) = 29.
		

Crossrefs

Cf. A093504.

Programs

  • Mathematica
    A093503list[nmax_]:=Module[{n=0},NestList[NextPrime[#+n++]&,2,nmax]];A093503list[100] (* Paolo Xausa, Aug 29 2023 *)
  • PARI
    p=2;for(n=1,53,print1(p,",");p=nextprime(p+n))

Extensions

Edited by Klaus Brockhaus, Apr 27 2004
Showing 1-1 of 1 results.