|
Search: id:A056142
|
|
|
| A056142 |
|
Concatenate n, floor[n/10], floor[n/100] ... (but do not continue if floor[.]=0). |
|
+0
2
|
|
| 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, 222, 232, 242, 252, 262, 272, 282, 292, 303, 313, 323, 333, 343, 353, 363, 373, 383, 393, 404, 414, 424, 434, 444, 454, 464, 474, 484, 494, 505, 515, 525, 535, 545, 555
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
For 0 < n < 100, a(n) = A056525(n). If n has 3 digits, then a(n) is a palindrome if and only if n is. If n has 4 or 5 digits, then a(n) is a palindrome if and only if all digits of n are equal. - David Wasserman (wasserma(AT)spawar.navy.mil), May 23 2005
Conjecture: if n has 3 or more digits, a(n) is a palindrome only if all the digits of n are the same. It is easy to see that any palindrome can have at most 2 distinct digits: matching digits from the initial n in the concatenation matches each digit after the second with an earlier digit. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Sep 07 2006
|
|
CROSSREFS
|
Cf. A002113, A056143, A056525.
Sequence in context: A056544 A082216 A052426 this_sequence A056525 A071272 A083851
Adjacent sequences: A056139 A056140 A056141 this_sequence A056143 A056144 A056145
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Jun 15 2000
|
|
|
Search completed in 0.002 seconds
|
