login
Number of primes == 9 (mod 10) less than 10^n.
4

%I #14 Aug 07 2018 11:24:33

%S 0,5,38,303,2390,19593,166032,1440186,12711333,113761326,1029509896,

%T 9401974132,86516371101

%N Number of primes == 9 (mod 10) less than 10^n.

%C This and the related sequences A073505-A073517 and A006880, A073548-A073565 are included because there is interest in the distribution of primes by their initial or final digits.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ModularPrimeCountingFunction.html">Modular Prime Counting Function</a>

%F A073505(n) + A073506(n) + A073507(n) + a(n) + 2 = A006880(n).

%e a(2) = 5 because there are 5 primes == 9 (mod 10) less than 10^2. They are 19, 29, 59, 79 and 89.

%t c = 0; k = 9; Do[While[k < 10^n, If[PrimeQ[k], c++ ]; k += 10]; Print[c], {n, 1, 10}]

%Y Cf. A006880, A087633, A073505, A073506, A073507, A073509, A073510, A073511, A073512, A073513, A073514, A073515, A073516, A073517.

%K base,nonn,more

%O 1,2

%A _Shyam Sunder Gupta_, Aug 14 2002

%E Edited by _Robert G. Wilson v_, Oct 03 2002

%E a(10) from _Robert G. Wilson v_, Dec 22 2003

%E a(11)-a(13) from _Giovanni Resta_, Aug 07 2018