|
| |
|
|
A078348
|
|
Primes p such that every decimal digit d in p appears exactly d times.
|
|
2
|
|
|
|
3313, 3331, 32233, 32323, 33223, 123323, 132233, 223133, 223313, 223331, 231323, 233231, 312233, 321323, 323123, 3344443, 3434443, 3443443, 4434343, 4443433, 14334443, 14443343, 14443433, 31434443, 31443443, 33434441, 33555553
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
The largest term is the prime 99999999988888888777777766666655555444223343.
|
|
|
LINKS
|
Giovanni Resta, Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
|
In the prime 3313 the digit "1" appears exactly one time and the digit "3" appears exactly three times.
|
|
|
MATHEMATICA
|
ddp[x_]:=Select[FromDigits/@Permutations[Flatten[PadRight[{}, #, #]&/@x]], PrimeQ]; Take[Flatten[ddp/@Subsets[Range[5]]]//Sort, 40] (* Harvey P. Dale, May 13 2020 *)
|
|
|
CROSSREFS
|
Sequence in context: A181559 A180679 A251900 * A078963 A236643 A175277
Adjacent sequences: A078345 A078346 A078347 * A078349 A078350 A078351
|
|
|
KEYWORD
|
base,easy,fini,nonn
|
|
|
AUTHOR
|
Carlos Rivera, Nov 22 2002
|
|
|
STATUS
|
approved
|
| |
|
|
