A165023 -id:A165023 - cp's OEIS frontend

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

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

Offset: 1

Joseph Myers, Sep 04 2009

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

Joseph Myers, Table of n, a(n) for n=1..1282
Index entries for the Kaprekar map

Cf. A165110, A165122, A165114, A165115, A165119, A165117, A165128.

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).

A165028 Consider the base-4 Kaprekar map x->K(x) described in A165012. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n.

Original entry on oeis.org

0, 126, 41958

Offset: 1

Joseph Myers, Sep 04 2009

Known values (to 200 base-4 digits):
a(1) = 0 (base 10) = 0 (base 4)
a(2) = 126 (base 10) = 1332 (base 4)
a(3) = 41958 (base 10) = 22033212 (base 4)

Index entries for the Kaprekar map

Cf. A165012, A165016, A165017, A165019, A165021, A165023.

In other bases: A153881 (base 2), A165008 (base 3), A165047 (base 5), A165067 (base 6), A165086 (base 7), A165106 (base 8), A165126 (base 9), A151959 (base 10).

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs