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.

A165023 Consider the base-4 Kaprekar map n->K(n) defined in A165012. Sequence gives least elements of each cycle of length > 1.

Original entry on oeis.org

126, 570, 41958, 2788950, 178846038, 11451491670, 732979762518, 46912048616790, 3002392592864598, 192153469566932310, 12297827549946664278, 787061051157936166230, 50371908681484475913558
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Comments

Initial terms in base 4: 1332, 20322, 22033212, 22220321112, 22222033211112, 22222203332111112, 22222220333321111112, 22222222033333211111112, 22222222203333332111111112, 22222222220333333321111111112.

Crossrefs

In other bases: Empty (base 2), A165004 (base 3), A165043 (base 5), A165062 (base 6), A165082 (base 7), A165101 (base 8), A165121 (base 9), A164720 (base 10).