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.

A379405 a(n) = p((n+1)*p(n)), where p(x) = least prime > x; i.e., p = A151800.

Original entry on oeis.org

3, 5, 11, 23, 29, 43, 53, 89, 101, 113, 127, 157, 173, 239, 257, 277, 293, 347, 367, 461, 487, 509, 541, 701, 727, 757, 787, 821, 853, 937, 967, 1187, 1223, 1259, 1297, 1361, 1373, 1559, 1601, 1657, 1693, 1811, 1861, 2069, 2129, 2179, 2213, 2549, 2609, 2657
Offset: 0

Views

Author

Clark Kimberling, Jan 18 2025

Keywords

Examples

			p(1) = 2, so a(1) = p(2*p(1)) = 5.
		

Crossrefs

Programs

  • Mathematica
    Table[NextPrime[(n+1)*NextPrime[n]], {n, 0, 80}]
  • PARI
    p(n) = nextprime(n+1);
    a(n) = p((n+1)*p(n)); \\ Michel Marcus, Jan 18 2025
    
  • Python
    from sympy import nextprime
    def A379405(n): return nextprime((n+1)*nextprime(n)) # Chai Wah Wu, Jan 20 2025

Formula

a(n) = A151800(A053024(n+1)). - Alois P. Heinz, Jan 18 2025