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.

A165068 a(n) = smallest number that leads to a new cycle under the base-6 Kaprekar map of A165051.

This page as a plain text file.
%I A165068 #6 Jun 02 2025 01:59:26
%S A165068 0,38,217,1297,1311,7777,7779,7790,7833,46657,279937,279938,279986,
%T A165068 280043,280238,1679617,1681257,10077697,10077698,10077710,10077803,
%U A165068 10077962,10078343,10079524,60466177,60466179,60475766,362797057
%N A165068 a(n) = smallest number that leads to a new cycle under the base-6 Kaprekar map of A165051.
%C A165068 Initial terms in base 6: 0, 102, 1001, 10001, 10023, 100001, 100003, 100022, 100133, 1000001.
%H A165068 Joseph Myers, <a href="/A165068/b165068.txt">Table of n, a(n) for n=1..23045</a>
%H A165068 <a href="/index/K#Kaprekar_map">Index entries for the Kaprekar map</a>
%Y A165068 Cf. A165051, A165056, A165069, A165070.
%Y A165068 In other bases: A164887 (base 2), A165009 (base 3), A165029 (base 4), A165048 (base 5), A165087 (base 7), A165107 (base 8), A165127 (base 9), A151964 (base 10).
%K A165068 base,nonn
%O A165068 1,2
%A A165068 _Joseph Myers_, Sep 04 2009