|
|
A083972
|
|
Smallest palindromic prime containing exactly n 1's.
|
|
10
|
|
|
313, 11, 18181, 11311, 1311131, 1114111, 110111011, 111181111, 11115151111, 1011117111101, 1110111110111, 1111118111111, 111111212111111, 111111151111111, 11121111111112111, 1011111110111111101, 1111111611161111111, 111110111171111011111, 1111111111111111111, 111111111161111111111, 11111111181118111111111, 1101111111119111111111011
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
digOfInterest = 1;
primes = {};
While[Length[primes] < 6,
n = Length[primes] + 1;
i = 0;
While[Length[primes] != n,
i++;
dig = IntegerDigits[Prime[i]];
If[
(dig == Reverse[dig]) &&
(Count[dig, digOfInterest] == n),
AppendTo[primes, FromDigits[dig]];
];
];
];
primes
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 21 2003
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|