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 A231795 #9 May 21 2014 17:10:48
%S A231795 0,8,184,3288,39133,444122,4973204,56589762,604756122,6423638745,
%T A231795 67538009241
%N A231795 Count of the first 10^n primes containing at least one 8's digit.
%F A231795 a(n) ~ 10^n. - _Charles R Greathouse IV_, May 21 2014
%e A231795 a(2)=8 because there are 8 primes not greater than 541 (the 100th prime) that contain a 8's digit. Namely: 83, 89, 181, 281, 283, 383, 389, 487.
%t A231795 cnt = 0; Table[Do[p = Prime[k]; If[MemberQ[IntegerDigits[p], 8], cnt++], {k, 10^(n - 1) + 1, 10^n}]; cnt, {n, 5}] (* _T. D. Noe_, Nov 13 2013 *)
%Y A231795 Cf. A231726-A231790, A231792-A231796, A091634-A091643, A231412, A228413-A228421.
%K A231795 more,nonn,base
%O A231795 1,2
%A A231795 _Robert Price_, Nov 13 2013