A344629 Primes p such that exactly five numbers among all circular permutations of the digits of p are prime.
11939, 19391, 19937, 37199, 39119, 71993, 91193, 93719, 93911, 99371, 103391, 103997, 107119, 110339, 111893, 111919, 113123, 113177, 113983, 114997, 117133, 117319, 117353, 117701, 118931, 119107, 119179, 119191, 119699, 123113, 127733, 129919, 131231, 131771
Offset: 1
Links
- Felix Fröhlich, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
PARI
rot(n) = if(#Str(n)==1, v=vector(1), v=vector(#n-1)); for(i=2, #n, v[i-1]=n[i]); u=vector(#n); for(i=1, #n, u[i]=n[i]); v=concat(v, u[1]); v eva(n) = subst(Pol(n), x, 10) is(n) = my(r=rot(digits(n)), i=0); while(r!=digits(n), if(ispseudoprime(eva(r)), i++); r=rot(r)); if(ispseudoprime(eva(r)), i++); if(n==1 || n==11, return(0)); if(i==5, 1, 0) forprime(p=1, 1e3, if(is(p), print1(p, ", ")))