This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056544 Least palindrome containing the digits of n as a subsequence. 2
 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; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS 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 * A082216 A052426 A240237 Adjacent sequences:  A056541 A056542 A056543 * A056545 A056546 A056547 KEYWORD base,easy,nonn AUTHOR Joseph L. Pe, Feb 10 2002 EXTENSIONS Edited and extended by Robert G. Wilson v, Feb 12 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 22 19:19 EDT 2019. Contains 323481 sequences. (Running on oeis4.)