|
Search: id:A056544
|
|
|
| A056544 |
|
Least palindrome containing the digits of n as a subsequence. |
|
+0
3
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 101, 11, 121, 131, 141, 151, 161, 171, 181, 191, 202, 121, 22, 232, 242, 252, 262, 272, 282, 292, 303, 131, 232, 33, 343, 353, 363, 373, 383, 393, 404, 141, 242, 343, 44, 454, 464, 474, 484, 494, 505, 151, 252, 353, 454, 55, 565, 575
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
The smallest palindrome containing 21 as a subsequence is 121. So a(21) = 121.
|
|
MATHEMATICA
|
Do[k = 1; While[ StringPosition[ ToString[k], ToString[n]] == {} || ToString[k] != StringReverse[ ToString[k]], k++ ]; Print[k], {n, 1, 70} ]
|
|
CROSSREFS
|
Sequence in context: A080436 A135295 A122625 this_sequence A082216 A052426 A056142
Adjacent sequences: A056541 A056542 A056543 this_sequence A056545 A056546 A056547
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Feb 10 2002
|
|
EXTENSIONS
|
Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 12 2002
|
|
|
Search completed in 0.002 seconds
|
