|
| |
|
|
A046893
|
|
a(n) has exactly n permutations of digits that are primes.
|
|
0
|
|
|
|
1, 2, 13, 103, 107, 1007, 1036, 1019, 1013, 1049, 1079, 1237, 10099, 10013, 10135, 10123, 10039, 10127, 10079, 10238, 10234, 10235, 10139, 10478, 12349, 12347, 10378, 12359, 14579, 10789, 100336, 10237, 12389, 23579, 10279, 100136, 12379
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Table of n, a(n) for n=0..36.
|
|
|
MATHEMATICA
|
a = Table[0, {40}]; Do[b = Count[ PrimeQ[ FromDigits /@ Permutations[ IntegerDigits[n]]], True]; If[b < 40 && a[[b + 1]] == 0, a[[b + 1]] = n; Print[b, " ", n]], {n, 1, 110000}]
|
|
|
CROSSREFS
|
Cf. A039999.
Sequence in context: A077246 A107000 A046891 * A126036 A113598 A125589
Adjacent sequences: A046890 A046891 A046892 * A046894 A046895 A046896
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
David W. Wilson
|
|
|
STATUS
|
approved
|
| |
|
|
