%I A161402
%S A161402 103,107,113,130,131,136,137,149,157,163,167,170,173,175,176,179,194,
%T A161402 197,199,301,307,310,311,316,317,337,359,361,370,371,373,379,389,395,
%U A161402 397,398,419,491,517,539,571,593,613,617,631,671,701,703,709,710,713
%N A161402 Numbers n such that the count of primes among the permutations of the 
               digits of n is greater than 2.
%C A161402 Leading zeros in the permutations are ignored.
%H A161402 C. Hilliard, <a href="a161401.txt">Comments and PARI program.</a>
%H A161402 Wikipedia,<a href="http://en.wikipedia.org/wiki/Permutation">Permutation</
               a>
%e A161402 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.
%o A161402 (PARI) Cf. C. Hilliard link.
%o A161402 (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) ]; [From Klaus Brockhaus, Jun 14 
               2009]
%Y A161402 Sequence in context: A129751 A094095 A074675 this_sequence A165294 A046076 
               A144714
%Y A161402 Adjacent sequences: A161399 A161400 A161401 this_sequence A161403 A161404 
               A161405
%K A161402 base,nonn
%O A161402 1,1
%A A161402 Cino Hilliard (hillcino368(AT)hotmail.com), Jun 09 2009
%E A161402 Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 14 2009