login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277005 Least prime greater than n-th compositorial. 0
2, 5, 29, 193, 1733, 17291, 207367, 2903041, 43545611, 696729629, 12541132817, 250822656001, 5267275776047, 115880067072017, 2781121609728037, 69528040243200079, 1807729046323200001, 48808684250726400031, 1366643159020339200397 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
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 *)
CROSSREFS
Sequence in context: A257163 A327765 A243276 * A350922 A007014 A265147
KEYWORD
easy,nonn
AUTHOR
Walter Carlini, Sep 25 2016
EXTENSIONS
a(18) corrected by Sean A. Irvine, Sep 26 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)