Smallest prime of the form 10^k + prime(n), k >= d, the number of digits in prime(n). 0 if no such primes exist. a(n) = 0 if prime(n) + 1 == 0 (mod 3).
A114782
Smallest prime of the form 10^k + prime(n), k >= d, the number of digits in prime(n). 0 if no such primes exist. a(n) = 0 if prime(n) + 1 == 0 (mod 3).
Terms
- a(0) =0a(1) =13a(2) =0a(3) =17a(4) =0a(5) =113a(6) =0a(7) =1019a(8) =0a(9) =0a(10) =131a(11) =137a(12) =0a(13) =100043a(14) =0a(15) =0a(16) =0a(17) =1061a(18) =167a(19) =0a(20) =173a(21) =179a(22) =0a(23) =0a(24) =197a(25) =0a(26) =1103a(27) =0a(28) =1109a(29) =0
External references
- oeis: A114782