Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 May 09 2021 08:12:55
%S 7,89,983,9941,99929,999931,9999929,99999827,999999739,9999999769,
%T 99999999763,999999999697,9999999999443,99999999999503,
%U 999999999999353,9999999999999431,99999999999999251,999999999999999463,9999999999999999343,99999999999999999199
%N n-th largest n-digit prime.
%C Cf. A069100: n-th smallest n-digit prime.
%H Eduard Roure Perdices, <a href="/A107109/b107109.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = prime[pi[10^n]-n+1]
%t Table[Prime[PrimePi[10^n]-n+1], {n, 13}]
%t a[n_] := NextPrime[10^n, -n]; (* _Eduard Roure Perdices_, May 09 2021 *)
%Y Cf. A069100.
%K nonn,base
%O 1,1
%A _Zak Seidov_, May 12 2005
%E Extended by _Eduard Roure Perdices_, May 09 2021