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 A151993 #2 Mar 30 2012 17:22:53
%S A151993 0,0,3,63,410,2949,21622,175504,1478015,12330087,107585476,937135794
%N A151993 Number of Honaker primes (A033548) less than 10^n.
%C A151993 G. L. Honaker, Jr. computed the first six terms. Are there an infinite number of Honaker primes?
%e A151993 a(3) = 3 because 131, 263, and 457 are the only Honaker primes less than 10^3.
%t A151993 nn=6; cnt=0; power10=10; Reap[Do[p=Prime[k]; If[p>power10, Sow[cnt]; power10=10*power10]; If[Total[IntegerDigits[k]] == Total[IntegerDigits[p]], cnt++ ], {k,PrimePi[10^nn]+1}]][[2,1]]
%Y A151993 Cf. A006880 (primes < 10^n).
%K A151993 hard,nonn,base
%O A151993 1,3
%A A151993 _T. D. Noe_, Sep 14 2009