The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #14 Jul 21 2015 06:02:51
%S 0,8,67,559,4917,44073,402030,3709989,34534791,323587790,3046685950,
%T 28798331502,273078628285,2596399340798
%N Number of primes less than 10^n having at least one digit 1.
%e a(2) = 8 because of the 25 primes less than 10^2, 8 have at least one 1 digit.
%t NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; c = 0; p = 1; Do[ While[ p = NextPrim[p]; p < 10^n, If[ Position[ IntegerDigits[p], 1] != {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (* _Robert G. Wilson v_, Feb 02 2004 *)
%t NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; c = 0; p = 1; Do[ While[ p = NextPrim[p]; p < 10^n, If[ Position[ IntegerDigits[p], 2] != {}, c++ ]]; Print[c]; p--, {n, 1, 8}] (* _Robert G. Wilson v_, Feb 02 2004 *)
%Y a(n) + A091635(n) = A006880(n).
%Y Cf. A091645, A091646, A091647, A091705, A091706, A091707, A091708, A091709, A091710.
%K more,nonn,base
%O 1,2
%A _Enoch Haga_, Jan 30 2004
%E Edited, corrected and extended by _Robert G. Wilson v_, Feb 02 2004
%E 3 more terms from _Ryan Propper_, Aug 20 2005
%E a(13) from _Robert Price_, Nov 11 2013
%E a(14) from _Giovanni Resta_, Jul 21 2015