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.

A121971 a(n) is the smallest number such that pi(n) divides n a record-breaking prime number of times.

Original entry on oeis.org

2, 27, 330, 3059, 175197, 1304498, 70115412, 514272411, 27788566029, 11091501630949, 81744303089590, 32781729631790293, 1784546064357412171, 13169525310647352914, 717466145742128063267
Offset: 1

Views

Author

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

Keywords

Examples

			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

Formula

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

Extensions

a(10)-a(11) from Donovan Johnson, Dec 02 2009
a(12)-a(15) from Ridouane Oudra, Aug 11 2019