|
Search: id:A100026
|
|
|
| A100026 |
|
Consider all (2n+1)-digit palindromic primes of the form 10...0M0...01 (so that M is a palindrome with <= 2n-1 digits); a(n) = smallest such M. |
|
+0
8
|
|
| 0, 3, 3, 3, 5, 8, 323, 5, 8, 212, 3, 161, 8, 3, 242, 3, 8, 10901, 737, 161, 242, 333, 282, 6, 252, 474, 5, 12921, 8, 131, 18381, 6, 444, 6, 797, 606, 717, 15351, 464, 333, 626, 545, 13031, 161, 747, 191, 323, 636, 32523, 303, 282, 888, 686, 18981, 111, 15951, 12021
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
f[n_] := Block[{k = 0, t = Flatten[Join[{1}, Table[0, {n - 1}]]]}, While[s = Drop[t, Min[ -Floor[ Log[10, k]/2], 0]]; k != FromDigits[ Reverse[ IntegerDigits[k]]] || !PrimeQ[ FromDigits[ Join[s, IntegerDigits[k], Reverse[s]]]], k++ ]; k]; Table[ f[n], {n, 56}] (from Robert G. Wilson v Nov 22 2004)
|
|
CROSSREFS
|
The corresponding palindromic primes are shown in A100027.
Cf. A099744, A099746, A100028.
Sequence in context: A117900 A122519 A141695 this_sequence A100049 A158315 A134059
Adjacent sequences: A100023 A100024 A100025 this_sequence A100027 A100028 A100029
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Harvey Dubner (harvey(AT)dubner.com), Nov 20 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 22 2004
|
|
|
Search completed in 0.002 seconds
|
