This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A344630 #13 Sep 22 2024 12:51:19
%S A344630 193939,199933,319993,331999,391939,393919,919393,933199,939193,
%T A344630 939391,993319,999331,1313999,1317727,1399913,1731893,1743737,1772713,
%U A344630 1893173,1977779,2713177,3139991,3173189,3177271,3189317,3717437,4373717,7174373,7271317,7318931
%N A344630 Primes p such that exactly six numbers among all circular permutations of the digits of p are prime.
%H A344630 Felix Fröhlich, <a href="/A344630/b344630.txt">Table of n, a(n) for n = 1..10000</a>
%t A344630 Select[Prime[Range[500000]],Total[Boole[PrimeQ[FromDigits/@Table[RotateRight[IntegerDigits[#],n],{n,0,IntegerLength[ #]-1}]]]]==6&] (* _Harvey P. Dale_, Sep 22 2024 *)
%o A344630 (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
%o A344630 eva(n) = subst(Pol(n), x, 10)
%o A344630 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==6, 1, 0)
%o A344630 forprime(p=1, 1e3, if(is(p), print1(p, ", ")))
%Y A344630 Cf. A270083. Row 6 of A317716.
%Y A344630 Cf. primes where exactly k numbers among all circular permutations of digits are prime: A068654 (k=1), A344626 (k=2), A344627 (k=3), A344628 (k=4), A344629 (k=5), A344631 (k=7), A344632 (k=8).
%K A344630 nonn,base
%O A344630 1,1
%A A344630 _Felix Fröhlich_, May 25 2021