login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121971 a(n) is the smallest number such that pi(n) divides n a record-breaking prime number of times. 0
2, 27, 330, 3059, 175197, 1304498, 70115412, 514272411, 27788566029, 11091501630949, 81744303089590, 32781729631790293, 1784546064357412171, 13169525310647352914, 717466145742128063267 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..15.

FORMULA

a(n) = A038625(A000040(n)). - Ridouane Oudra, Aug 11 2019

EXAMPLE

a(3)=330 because pi(330)=66 and 330 divided by 66 is 5, the first prime greater than the prime quotient in a(2) which was 3.

CROSSREFS

Cf. A000720, A000040, A038625.

Sequence in context: A199021 A091709 A083384 * A278790 A277832 A221674

Adjacent sequences:  A121968 A121969 A121970 * A121972 A121973 A121974

KEYWORD

more,nonn

AUTHOR

G. L. Honaker, Jr., Sep 04 2006

EXTENSIONS

a(10)-a(11) from Donovan Johnson, Dec 02 2009

a(12)-a(15) from Ridouane Oudra, Aug 11 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 15:08 EST 2019. Contains 329979 sequences. (Running on oeis4.)