A277005 Least prime greater than n-th compositorial.

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

Offset

0,1

Links

Harvey P. Dale, Table of n, a(n) for n = 0..430

Formula

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

Example

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.

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 *)
Join[{2}, NextPrime[FoldList[Times, Select[Range[30], CompositeQ]]]] (* Harvey P. Dale, May 26 2026 *)

Crossrefs

Cf. A036691, A038710, A151800.

Sequence in context: A257163 A327765 A243276 * A350922 A007014 A265147

Adjacent sequences: A277002 A277003 A277004 * A277006 A277007 A277008

Keyword

easy,nonn

Author

Walter Carlini, Sep 25 2016

Extensions

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

Status

approved