login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n)-th prime is the smallest prime containing exactly n 0's.
1

%I #22 Sep 03 2024 08:25:44

%S 1,26,169,1230,9593,78499,1270608,5761456,50847535,1300005927,

%T 4118054814,73301896140,1320811971703,29844570422670,169969662554552,

%U 547863431950009,2623557157654234,24739954287740861,1347790196060095448,10720710117789005898,161902001837504830334

%N a(n)-th prime is the smallest prime containing exactly n 0's.

%H Andrew R. Booker, <a href="https://t5k.org/nthprime/">The Nth Prime Page</a>.

%H Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>.

%F a(n) = A000720(A037053(n)). - _Daniel Suteu_, Aug 08 2019

%t (* see A037053 for f *) PrimePi[ Table[ f[n], {n, 1, 12}]]

%Y Cf. A000720, A034388, A037053.

%K nonn,base,hard

%O 0,2

%A _Patrick De Geest_, Jan 04 1999

%E Edited and extended by _Robert G. Wilson v_, Jul 04 2003

%E a(0) = 1 inserted and a(13)-a(17) added by _Daniel Suteu_, Aug 08 2019

%E a(18)-a(20) calculated using Kim Walisch's primecount and added by _Amiram Eldar_, Sep 03 2024