OFFSET
1,2
EXAMPLE
101, 401, 1601 and 8101 are primes; so a(2) = 4.
MATHEMATICA
c = k = 0; lst = {}; Do[ While[k <= 10^n, If[ PrimeQ[k^2 + 1], c++]; k+=10]; AppendTo[lst, c]; Print[c], {n, 9}] (* Robert G. Wilson v, Mar 30 2018 *)
PROG
(Python)
from sympy import isprime
def A301943(n):
return sum(1 for i in range(1, 10**(n-1)+1) if isprime(100*i**2+1)) # Chai Wah Wu, Mar 30 2018
CROSSREFS
KEYWORD
nonn,more,base
AUTHOR
Seiichi Manyama, Mar 29 2018
EXTENSIONS
a(10) from Robert G. Wilson v, Mar 31 2018
a(11) from Robert G. Wilson v, Apr 04 2018
STATUS
approved