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.

A090226 Least k such that prime(k) has n digits. Index of least n-digit prime.

This page as a plain text file.
%I A090226 #14 Apr 03 2023 10:36:10
%S A090226 1,5,26,169,1230,9593,78499,664580,5761456,50847535,455052512,
%T A090226 4118054814,37607912019,346065536840,3204941750803,29844570422670,
%U A090226 279238341033926,2623557157654234,24739954287740861,234057667276344608,2220819602560918841,21127269486018731929
%N A090226 Least k such that prime(k) has n digits. Index of least n-digit prime.
%H A090226 Eduard Roure Perdices, <a href="/A090226/b090226.txt">Table of n, a(n) for n = 1..29</a>
%H A090226 C. Caldwell's Prime Pages, <a href="https://t5k.org/howmany.shtml#table">A Table of values of pi(x)</a>.
%H A090226 X. Gourdon, <a href="http://numbers.computation.free.fr/Constants/Primes/pixtable.html">A Table of values of pi(x)</a>.
%F A090226 a(1)=1; a(n) = pi(10^(n-1)) + 1 for n > 1 where pi(x) is the number of primes less than x. - C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 26 2004
%F A090226 a(n) = A006880(n-1) + 1, for n >= 1. - _Eduard Roure Perdices_, Apr 18 2021
%t A090226 Table[PrimePi[NextPrime[10^n]],{n,0,14}] (* This generates the first 15 terms of the sequence, but Mathematica cannot generate the 16th term using this program. *) (* _Harvey P. Dale_, May 12 2019 *)
%Y A090226 Cf. A003617 (values of prime(k)), A006880.
%K A090226 base,nonn
%O A090226 1,2
%A A090226 _Amarnath Murthy_, Nov 25 2003
%E A090226 Corrected and extended by C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 26 2004
%E A090226 Extended by _Eduard Roure Perdices_, Apr 18 2021