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 A065687 #17 Dec 15 2024 11:01:09
%S A065687 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,2,2,2,2,2,2,2,2,2,2,
%T A065687 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U A065687 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2
%N A065687 Number of primes <= prime(n) which begin with an 8.
%H A065687 Harry J. Smith, <a href="/A065687/b065687.txt">Table of n, a(n) for n = 1..1000</a>
%e A065687 83 = A000040(23) is the first prime beginning with an 8, so a(23) = 1 and a(i) = 0 for i < 23. a(664579) = 71038 (A000040(664579) = 9999991 is the largest prime < 10,000,000).
%t A065687 Accumulate[If[First[IntegerDigits[#]] == 8, 1, 0]&/@Prime[Range[100]]] (* _Vincenzo Librandi_, Nov 28 2016 *)
%o A065687 (PARI) lista(n) = { my(a=[p\10^logint(p,10)==8 | p<-primes(n)]); for(i=2, #a, a[i]+=a[i-1]); a} \\ _Harry J. Smith_, Oct 26 2009
%Y A065687 Cf. A000040, A045714, A065680.
%K A065687 base,nonn
%O A065687 1,24
%A A065687 _Reinhard Zumkeller_, Nov 13 2001