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.

Showing 1-1 of 1 results.

A319798 Smallest fixed points (>0) of the base-n Kaprekar map.

Original entry on oeis.org

9, 184, 30, 8, 105, 1922263344, 21, 41520, 495, 40, 858, 3488424, 65, 30996, 2040, 96, 2907, 264925230120, 133, 2787400, 5313, 176, 6900, 237360, 225, 9742824, 10962, 280, 13485, 763713003420, 341, 26485184, 19635, 408, 23310, 107599353444576, 481, 60920080, 31980
Offset: 2

Views

Author

Seiichi Manyama, Sep 28 2018

Keywords

Comments

Conjecture: If n = 3*k - 1 (>2), a(n) = A000567(k). For example, a(29) = 10 * (3*10 - 2) = 280.

Links

Crossrefs

Cf. A000567, A099009, A163205, A164997, A165016, A165036, A165055, A165075, A165094, A165114, A319839.

Extensions

a(19) and a(31)-a(40) from Giovanni Resta, Oct 02 2018
Showing 1-1 of 1 results.

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

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