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.

A165023 Consider the base-4 Kaprekar map n->K(n) defined in A165012. Sequence gives least elements of each cycle of length > 1.

Table of values

n a(n)
1 126
2 570
3 41958
4 2788950
5 178846038
6 11451491670
7 732979762518
8 46912048616790
9 3002392592864598
10 192153469566932310
11 12297827549946664278
12 787061051157936166230
13 50371908681484475913558

List of values

[126, 570, 41958, 2788950, 178846038, 11451491670, 732979762518, 46912048616790, 3002392592864598, 192153469566932310, 12297827549946664278, 787061051157936166230, 50371908681484475913558]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.