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.

Showing 1-3 of 3 results.

A066144 In base 2: 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, 2, 11, 19, 20, 74, 398, 779, 1062, 2329, 4189, 4280, 11278, 19962, 98318, 135137, 1051360, 1592930, 69226926, 4295054186, 4446008678, 17187271449, 18123849698
Offset: 1

Views

Author

Klaus Brockhaus, Dec 08 2001

Keywords

Comments

The analog of A065198 in base 2. Integers like 22, for which a palindrome is never reached (cf. A066059), are of course disregarded. A066145 gives the corresponding records.

Examples

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

Links

Crossrefs

Record setting values in base b: A077406 (b=3), A075686 (b=4), A306599 (b=8), A065198 (b=10), A348571 (Zeckendorf).
Cf. A062130, A066057, A066058, A066059, A066145.

Programs

  • Mathematica
    limit = 10^4; (* Assumes that there is no palindrome if none is found before "limit" iterations *)
best = -1; Select[Range[0, 100000], (np = #; i = 0;
   While[np != IntegerReverse[np, 2] && i < limit,
    np = np + IntegerReverse[np, 2]; i++];
If[i >= limit, False, If[i > best, best = i; True]]) &] (* Robert Price, Oct 14 2019 *)

Extensions

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

A075687 In base 4, records for the number of Reverse and Add! steps needed to reach a palindrome.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 16, 17, 29, 35, 37, 38, 79, 80, 107
Offset: 0

Views

Author

Klaus Brockhaus, Sep 24 2002

Keywords

Comments

RECORDS transform of A075685. Base-4 analog of A065199 (base 10) and A066145 (base 2). A075686 gives the corresponding starting points.

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.

Links

Crossrefs

Cf. A065199, A066145, A075685, A075686.

A077406 In base 3: 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, 3, 5, 15, 17, 53, 1466, 9717, 32857, 37340, 37366, 37367, 531773, 1596329
Offset: 1

Views

Author

Klaus Brockhaus, Nov 05 2002

Keywords

Comments

RECORDS transform of A077402. - Base-3 analog of A066144 (base 2), A075686 (base 4) and A065198 (base 10). Integers like 103, for which a palindrome is (presumably) never reached (cf. A077404), are of course disregarded. A077407 gives the corresponding records.

Examples

			Starting with 15, 3 Reverse and Add! steps are needed to reach a palindrome; starting with n < 15, less (at most 2) steps are needed.

Links

Crossrefs

Cf. A065198, A066144, A075686, A077402, A077404, A077407.

Extensions

a(14) from Sean A. Irvine, Apr 19 2010
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.