OFFSET
1,1
COMMENTS
Cyclops numbers that are prime numbers: primes with an odd number of digits with middle digit 0 that have only one digit 0.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..10000
G. L. Honaker, Jr. and Chris K. Caldwell, Prime Curios! 688846502588399
G. L. Honaker, Jr. and Chris K. Caldwell, Prime Curios! 99194853094755497
MATHEMATICA
(* First run the program given for A134808 *) Select[Prime[Range[2000]], cyclopsQ] (* Alonso del Arte, Dec 16 2010 *)
cycQ[n_]:=Module[{idn=IntegerDigits[n], len}, len=Length[idn]; OddQ[len] && Count[idn, 0] == 1 && idn[[(len+1)/2]]==0]; Select[Flatten[Table[Prime[ Range[ PrimePi[10^(2n)+1], PrimePi[10^(2n+1)]]], {n, 2}]], cycQ] (* Harvey P. Dale, Jun 20 2014 *)
PROG
(Python) # cyclops() in A134808
from sympy import isprime
print([c for c in cyclops(upto=13063) if isprime(c)]) # Michael S. Branicky, Jan 05 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Omar E. Pol, Nov 25 2007
EXTENSIONS
Links added by Omar E. Pol, Mar 25 2011
STATUS
approved