OFFSET
1,1
COMMENTS
Leading zeros in the permutations are ignored.
LINKS
EXAMPLE
103 has three permutations of its digits 1, 0, 3 that form a prime, namely 103, 031, 013. So the count of primes for 103 is greater than 2 and 103 is in the sequence.
MATHEMATICA
Select[Range[800], Count[FromDigits/@Permutations[ IntegerDigits[#]], _?PrimeQ]> 2&] (* Harvey P. Dale, Nov 24 2010 *)
PROG
(PARI) See Hilliard link.
(Magma) [ n: n in [1..720] | #[ s: s in Seqset([ Seqint([m(p[i]):i in [1..#x] ], 10): p in Permutations(Seqset(x)) ]) | IsPrime(s) ] gt 2 where m is map< x->y | [<x[i], y[i]>:i in [1..#x] ] > where x is [1..#y] where y is Intseq(n, 10) ]; // Klaus Brockhaus, Jun 14 2009
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Cino Hilliard, Jun 09 2009
EXTENSIONS
Edited by Klaus Brockhaus, Jun 14 2009
STATUS
approved