A037052 - OEIS

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

A037052

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

1

1, 26, 169, 1230, 9593, 78499, 1270608, 5761456, 50847535, 1300005927, 4118054814, 73301896140, 1320811971703, 29844570422670, 169969662554552, 547863431950009, 2623557157654234, 24739954287740861, 1347790196060095448, 10720710117789005898, 161902001837504830334

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

Table of n, a(n) for n=0..20.

Andrew R. Booker, The Nth Prime Page.

Kim Walisch, Fast C++ prime counting function implementation (primecount).

FORMULA

a(n) = A000720(A037053(n)). - Daniel Suteu, Aug 08 2019

MATHEMATICA

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

CROSSREFS

Cf. A000720, A034388, A037053.

Sequence in context: A279744 A214353 A283567 * A156339 A268331 A125336

Adjacent sequences: A037049 A037050 A037051 * A037053 A037054 A037055

KEYWORD

nonn,base,hard

AUTHOR

Patrick De Geest, Jan 04 1999

EXTENSIONS

Edited and extended by Robert G. Wilson v, Jul 04 2003

a(0) = 1 inserted and a(13)-a(17) added by Daniel Suteu, Aug 08 2019

a(18)-a(20) calculated using Kim Walisch's primecount and added by Amiram Eldar, Sep 03 2024

STATUS

approved