OFFSET
1,1
COMMENTS
There are 14 of these primes with 3 digits and 302 with 5 digits.
LINKS
Rodolfo Ruiz-Huidobro, Table of n, a(n) for n = 1..3194
EXAMPLE
The first term, a(1), is 101 because if you remove the "cyclops' eye" it remains a prime (11) and because 101 is the 1st cyclops prime.
307 is a term because when you remove the "0" it remains a prime: 37.
PROG
(Magma) a:=[]; f:=func<n|IsPrime(n) and IsOdd(#a) and a[(#a+1) div 2] eq 0 and not 0 in a[1..(#a-1) div 2] cat a[(#a+3) div 2..#a] where a is Intseq(n)>; g:=func<n|Seqint(a[1..(#a-1) div 2] cat a[(#a+3) div 2..#a]) where a is Intseq(n)>; for n in [1..20000] do if f(n) and IsPrime(g(n)) then Append(~a, n); end if; end for; a; // Marius A. Burtea, Nov 20 2019
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Rodolfo Ruiz-Huidobro, Nov 20 2019
STATUS
approved