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 #22 Sep 11 2024 00:38:18
%S 0,2,3,4,5,6,8,9,10,11,12,14,15,16,17,18,20,21,22,24,25,26,27,28,29,
%T 30,32,33,34,35,36,37,38,39,40,41,42,44,45,46,48,49,50,51,52,54,55,56,
%U 57,58,60,62,63,64,65,66,67,68,69,70,72,74,75,76,77,78,80,81
%N Lexicographically earliest infinite sequence of distinct integers k such that there are k primes in the sequence strictly less than k^2.
%H Dominic McCarty, <a href="/A114024/b114024.txt">Table of n, a(n) for n = 1..690</a>
%H Dominic McCarty, <a href="/A114024/a114024.txt">C++ program for A114024</a>
%e There are 0 primes < 0^2 (=0) in the whole sequence;
%e There are 2 primes < 2^2 (=4) -- they are 2 and 3;
%e There are 3 primes < 3^2 (=9) -- they are 2, 3 and 5;
%e There are 4 primes < 4^2 (=16) -- they are 2,3,5 and 11;
%e etc.
%K base,easy,nonn
%O 1,2
%A _Eric Angelini_, Feb 01 2006
%E a(42)-a(61) corrected by _Dominic McCarty_, Sep 10 2024