cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

0, 4, 7, 26, 28, 127, 199, 296, 511, 3119, 16861, 18164, 19453, 20468, 270824
Offset: 0

Views

Author

Klaus Brockhaus, Sep 24 2002

Keywords

Comments

RECORDS transform of A075685. - Base-4 analog 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.

Examples

			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