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.

A165121 Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives least elements of each cycle of length > 1.

Original entry on oeis.org

16, 320, 2256, 3712, 34960, 183696, 3496800, 31596672, 278474880, 2066242576, 2516902752, 26531651360, 167365651216, 203869268832, 211282856832, 2145190286000, 2184410558000, 16513410921312, 176898519791120
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Comments

Initial terms in base 9: 17, 385, 3076, 5074, 52854, 308876, 6518633, 65407433, 641888643, 5288888854.

Crossrefs

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