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.

A277005 Least prime greater than n-th compositorial.

Original entry on oeis.org

2, 5, 29, 193, 1733, 17291, 207367, 2903041, 43545611, 696729629, 12541132817, 250822656001, 5267275776047, 115880067072017, 2781121609728037, 69528040243200079, 1807729046323200001, 48808684250726400031, 1366643159020339200397
Offset: 0

Views

Author

Walter Carlini, Sep 25 2016

Keywords

Examples

			a(0) = A151800(A036691(0)) = A151800(1) = 2; where the zeroth compositorial, A036691(0), is the empty product = 1.
a(3) = 193, which is the least prime number greater than the third compositorial number, 192 = 4 * 6 * 8.
		

Crossrefs

Programs

  • Mathematica
    findComp[n_] := FixedPoint[n + PrimePi@ # + 1 &, n + PrimePi@ n + 1] ; Table[NextPrime@ Product[findComp@ k, {k, n}], {n, 0, 18}] (* Michael De Vlieger, Sep 25 2016, after Robert G. Wilson v at A036691 *)

Formula

a(n) = A151800(A036691(n)). - Michel Marcus, Sep 25 2016

Extensions

a(18) corrected by Sean A. Irvine, Sep 26 2023