|
| |
|
|
A075686
|
|
In base 4, n sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with n.
|
|
2
| |
|
|
0, 4, 7, 26, 28, 127, 199, 296, 511, 3119, 16861, 18164, 19453, 20468, 270824
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| RECORDS transform of A075685. - Base-4 analogue of A065198 (base 10) and A066144 (base 2). Integers like 290, for which a palindrome is (presumably) never reached (cf. A075420), are of course disregarded. A075687 gives the corresponding records.
|
|
|
LINKS
| N. J. A. Sloane, Transforms
Index entries for sequences related to Reverse and Add!
|
|
|
EXAMPLE
| Starting with 26, 3 Reverse and Add! steps are needed to reach a palindrome; starting with n < 26, less (at most 2) steps are needed.
|
|
|
CROSSREFS
| Cf. A065198, A066144, A075420, A075685, A075687.
Sequence in context: A073218 A151348 A110413 * A077441 A197789 A076148
Adjacent sequences: A075683 A075684 A075685 * A075687 A075688 A075689
|
|
|
KEYWORD
| base,more,nonn
|
|
|
AUTHOR
| Klaus Brockhaus. (klaus-brockhaus(AT)t-online.de), Sep 24 2002
|
| |
|
|
