|
| |
|
|
A061563
|
|
Start with n; add to itself with digits reversed; if palindrome, stop; otherwise repeat; a(n) gives palindrome at which it stops, or -1 if no palindrome is ever reached.
|
|
5
| |
|
|
0, 2, 4, 6, 8, 11, 33, 55, 77, 99, 11, 22, 33, 44, 55, 66, 77, 88, 99, 121, 22, 33, 44, 55, 66, 77, 88, 99, 121, 121, 33, 44, 55, 66, 77, 88, 99, 121, 121, 363, 44, 55, 66, 77, 88, 99, 121, 121, 363, 484, 55, 66, 77, 88, 99, 121, 121, 363, 484, 1111, 66, 77, 88, 99, 121
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| It is believed that n = 196 ist the least integer which never reaches a palindrome.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..195
Index entries for sequences related to Reverse and Add!
|
|
|
EXAMPLE
| 19 -> 19 + 91 = 110 -> 110 + 011 = 121, so a(19) = 121.
|
|
|
PROG
| (ARIBAS): var st: stack; test: boolean; end; for k := 0 to 60 do n := k; test := true; while test do n := n + int_reverse(n); test := n <> int_reverse(n); end; stack_push(st, n); end; stack2array(st).
|
|
|
CROSSREFS
| Cf. A033865. See also A016016, A023109, A006950, A023108.
Sequence in context: A071241 A068062 A088169 * A099994 A068065 A028328
Adjacent sequences: A061560 A061561 A061562 * A061564 A061565 A061566
|
|
|
KEYWORD
| nonn,base,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 18 2001
|
|
|
EXTENSIONS
| Corrected and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 20 2001
More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 25 2003
|
| |
|
|
