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.

A165043 Consider the base-5 Kaprekar map n->K(n) defined in A165032. Sequence gives least elements of each cycle of length > 1.

Original entry on oeis.org

48, 1992, 7488, 53712, 249992, 6249992, 45781056, 170312312, 1144531056, 1205467776, 4514058432, 4576557032, 22460937432, 28613281056, 28671874056, 30136717776, 30441401376, 106445312312, 112304687432, 715332031056
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Comments

Initial terms in base 5: 143, 30432, 214423, 3204322, 30444432, 3044444432, 43204443211, 322044443222, 4320444443211, 4432044432101.

Crossrefs

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