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.

A165082 Consider the base-7 Kaprekar map n->K(n) defined in A165071. Sequence gives least elements of each cycle of length > 1.

Original entry on oeis.org

144, 1068, 9936, 55500, 640992, 3562968, 31412208, 220709400, 227429400, 228238488, 11150046252, 11432420652, 75796404672, 419850417612, 546394287000, 3939440152944, 26773614188652, 26884299308652
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Comments

Initial terms in base 7: 264, 3054, 40653, 320544, 5306532, 42166443, 530666532, 5316666432, 5431055322, 5440665222.

Crossrefs

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