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.

A165101 Consider the base-8 Kaprekar map n->K(n) defined in A165090. Sequence gives least elements of each cycle of length > 1.

Original entry on oeis.org

1022, 1589, 17892, 21483, 102837, 1445787, 1707930, 6589877, 13667738, 93093147, 110132442, 111443346, 421817781, 874802586, 878996762, 1029991697, 7034104602, 7168322322, 7302540042, 26996862389, 55987891610, 56256326938
Offset: 1

Views

Author

Joseph Myers, Sep 04 2009

Keywords

Comments

Initial terms in base 8: 1776, 3065, 42744, 51753, 310665, 5407633, 6407632, 31106665, 64106632, 543076433.

Crossrefs

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