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.

A165008 Consider the base-3 Kaprekar map x->K(x) described in A164993. 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.

Table of values

n a(n)
1 0
2 32
3 320
4 26240
5 1240024
6 11160256
7 2297798771761759543384
8 15075857741528904364175224
9 8135830264
10 5931020266096
11 659002251784
12 350220815692997944

List of values

[0, 32, 320, 26240, 1240024, 11160256, 2297798771761759543384, 15075857741528904364175224, 8135830264, 5931020266096, 659002251784, 350220815692997944]