a(n) = smallest prime p for which cyclic digit shifts produce exactly n different primes, or 0 if no such p exists for n.

A247153

a(n) = smallest prime p for which cyclic digit shifts produce exactly n different primes, or 0 if no such p exists for n.

Terms

    a(0) =2a(1) =13a(2) =113a(3) =1193a(4) =11939a(5) =193939a(6) =17773937a(7) =119139133a(8) =111133719913a(9) =111119917373a(10) =111393733793

External references