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.
%I A121971 #11 Aug 11 2019 12:27:17 %S A121971 2,27,330,3059,175197,1304498,70115412,514272411,27788566029, %T A121971 11091501630949,81744303089590,32781729631790293,1784546064357412171, %U A121971 13169525310647352914,717466145742128063267 %N A121971 a(n) is the smallest number such that pi(n) divides n a record-breaking prime number of times. %F A121971 a(n) = A038625(A000040(n)). - _Ridouane Oudra_, Aug 11 2019 %e A121971 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. %Y A121971 Cf. A000720, A000040, A038625. %K A121971 more,nonn %O A121971 1,1 %A A121971 _G. L. Honaker, Jr._, Sep 04 2006 %E A121971 a(10)-a(11) from _Donovan Johnson_, Dec 02 2009 %E A121971 a(12)-a(15) from _Ridouane Oudra_, Aug 11 2019