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.

A171813 Trajectory of 1 under repeated applications of the map i -> A171798(i).

Original entry on oeis.org

1, 101, 734, 1037, 1174, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165
Offset: 1

Views

Author

N. J. A. Sloane, Oct 15 2010, Oct 16 2010

Keywords

Comments

Start with n, repeatedly apply the map i -> A171798(i). Then every n converges to one of 1019, 1147, 1165 or 14311. Proof: this is true by direct calculation for n=1..2^14. For larger n, A171798(n) < n.

Crossrefs

Cf. A171798.

Programs

  • Mathematica
    ans[n_]:=Module[{idn2=IntegerDigits[n,2]},FromDigits[{Length[ idn2], Count[ idn2,0], Count[ idn2,1]}]]; NestList[ans,1,40] (* Harvey P. Dale, Mar 30 2016 *)