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 A321281 #34 Nov 14 2018 22:10:48
%S A321281 21,15,13,8,9,5,3,8,8,2,2,3,2,0,2,2,2,3,2,5,1,4,0,3,1,1,1,2,2,0,2,0,0,
%T A321281 0,2,2,1,1,3,1,0,2,0,0,3,2,0,0,1,0,0,1,1,0,1,2,2,1,0,2,0,1,0,0,1,0,1,
%U A321281 0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,0,1,0,1
%N A321281 a(n) is the number of primes of the form p*10^n + q, where p, q are the digits from 1 to 9.
%H A321281 Robert Israel, <a href="/A321281/b321281.txt">Table of n, a(n) for n = 1..3000</a>
%H A321281 Sabin Tabirca and Kieran Reynolds, <a href="http://multimedia.ucc.ie/Staff/ST/articles/SNJ03_Tabirca1.ps">Lacunary Prime Numbers</a>.
%e A321281 a(6) = 5 because there are five primes of the form p*10^6 + q where p, q are the digits from 1 to 9: 1000003, 2000003, 7000003, 7000009, 8000009.
%p A321281 f:= n -> nops(select(isprime,[seq(seq(p*10^n+q,p=1..9),q=[1,3,7, 9])])):
%p A321281 map(f, [$1..100]); # _Robert Israel_, Nov 14 2018
%t A321281 a[n_]:=(c=0; Do[ Do[ If[PrimeQ[i*10^n+j], c++], {i,1,9}], {j,1,9,2}]; c); Array[a, 20] (* _Amiram Eldar_, Nov 14 2018 *)
%o A321281 (PARI) a(n)={my(t=10^n); sum(i=1, 9, sum(j=1, 5, isprime(2*j-1+i*t)))} \\ _Andrew Howroyd_, Nov 10 2018
%Y A321281 Cf. A000040.
%K A321281 nonn,base
%O A321281 1,1
%A A321281 _Anton Deynega_, Nov 10 2018
%E A321281 a(16)-a(86) from _Andrew Howroyd_, Nov 10 2018