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.

A066145 In base 2, records for the number of 'Reverse and Add' steps needed to reach a palindrome.

Original entry on oeis.org

0, 1, 2, 4, 5, 11, 21, 32, 37, 46, 48, 49, 53, 89, 99, 142, 147, 273, 297, 345, 515, 550, 573
Offset: 1

Views

Author

Klaus Brockhaus, Dec 08 2001

Keywords

Comments

The analog of A065199 in base 2. A066144 gives the corresponding starting points.
Terms a(19..22) obtained by assuming that a(n+1) <= a(n) + 300. - A.H.M. Smeets, Apr 30 2022

Examples

			Starting with 74, 11 'Reverse and Add' steps are needed to reach a palindrome; starting with n < 74, at most 5 steps are needed.
		

Crossrefs

Record values in base b: A077407 (b=3), A075687 (b=4), A306600 (b=8), A065199 (b=10), A348572 (Zeckendorf).

Programs

  • Mathematica
    limit = 10^3; (* Assumes that there is no palindrome if none is found before "limit" iterations *)
    best = -1; lst = {};
    For[n = 0, n <= 10000, n++,
    np = n; i = 0;
    While[np != IntegerReverse[np, 2] && i < limit,
      np = np + IntegerReverse[np, 2]; i++];
    If[i < limit && i > best, best = i; AppendTo[lst, i]]]; lst (* Robert Price, Oct 14 2019 *)

Extensions

Offset corrected and a(19)-a(23) by A.H.M. Smeets, Apr 30 2022