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.
%I A236469 #21 Aug 04 2014 05:23:03
%S A236469 64553,64567,64577,64591,64601,64661
%N A236469 Primes p such that pi(p) = floor(p/10), where pi is the prime counting function.
%C A236469 No further term below 32452843.
%C A236469 The first three terms in the sequence are consecutive primes.
%C A236469 Is this sequence finite?
%C A236469 No further term below 179424673.
%C A236469 The prime number theorem implies that this sequence is finite. Rosser proves that pi(x) < x/(log x - 4) for x >= 55, which can be used to show that there are no more terms. - _Eric M. Schmidt_, Aug 04 2014
%H A236469 J. B. Rosser. <a href="http://dx.doi.org/10.2307/2371291">Explicit bounds for some functions of prime numbers</a>. Amer. J. Math. 63 (1941), 211-232.
%p A236469 KD := proc() local a,b; a:=ithprime(n); b:=floor(a/10); if n=b then RETURN (a);fi; end: seq(KD(), n=1..1000000);
%t A236469 Do[p = Prime[n]; k = Floor[p/10]; If[k == n, Print[p]], {n, 10^6}] (* Bajpai *)
%t A236469 Select[Prime[Range[6500]], PrimePi[#] == Floor[#/10] &] (* _Alonso del Arte_, Jan 26 2014 *)
%Y A236469 Cf. A075902, A114924, A067248.
%K A236469 nonn,less,fini,full
%O A236469 1,1
%A A236469 _K. D. Bajpai_, Jan 26 2014