|
Search: id:A065318
|
|
|
| A065318 |
|
24 'Reverse and Add' steps are needed to reach a palindrome. |
|
+0
10
|
|
| 89, 98, 16991, 17981, 18971, 19961, 26990, 27980, 28970, 29960, 50169, 51159, 52149, 53139, 54129, 55119, 56109, 56199, 57189, 58179, 59169, 60168, 60649, 61158, 61639, 62148, 62629, 63138, 63619, 64128, 64609, 64699, 65118, 65689
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The number of steps starts at 0, so palindromes (cf. A002113) are excluded. 24 is a record (cf. A065199) of the number of 'Reverse and Add' steps needed to reach a palindrome.
|
|
LINKS
|
Index entries for sequences related to Reverse and Add!
|
|
PROGRAM
|
(ARIBAS): function revaddi_steps(k, start, up: integer); var n, m, steps, rev: integer; begin for n := start to up do m := n; rev := int_reverse(m); steps := 0; while steps < k and m <> rev do m := m + rev; rev := int_reverse(m); inc(steps); end; if steps = k and m = rev then write(n, " "); end; end; end; revaddi_steps(24, 0, 66200).
|
|
CROSSREFS
|
A002113, A065198, A065199.
Sequence in context: A039437 A043260 A044040 this_sequence A033254 A032691 A146352
Adjacent sequences: A065315 A065316 A065317 this_sequence A065319 A065320 A065321
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 30 2001
|
|
|
Search completed in 0.002 seconds
|
