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.

A378135 a(n) = p(n*p(n)), where p(x) = least prime > x.

Original entry on oeis.org

2, 3, 7, 17, 23, 37, 43, 79, 89, 101, 113, 149, 157, 223, 239, 257, 277, 331, 347, 439, 461, 487, 509, 673, 701, 727, 757, 787, 821, 907, 937, 1151, 1187, 1223, 1259, 1297, 1361, 1523, 1559, 1601, 1657, 1777, 1811, 2027, 2069, 2129, 2179, 2503, 2549, 2609, 2657
Offset: 0

Views

Author

Clark Kimberling, Nov 20 2024

Keywords

Examples

			p(0) = 2, so a(0) = p(0*p(0)) = 2.
		

Crossrefs

Programs

  • Mathematica
    Table[NextPrime[n*NextPrime[n]], {n, 1, 80}]
  • PARI
    p(n) = nextprime(n+1);
    a(n) = p(n*p(n)); \\ Michel Marcus, Nov 21 2024

Formula

a(n) = A151800(n*A151800(n)).