login
Consider the base-7 Kaprekar map n->K(n) defined in A165071. Sequence gives least elements of each cycle of length > 1.
13

%I #4 Mar 30 2012 17:28:43

%S 144,1068,9936,55500,640992,3562968,31412208,220709400,227429400,

%T 228238488,11150046252,11432420652,75796404672,419850417612,

%U 546394287000,3939440152944,26773614188652,26884299308652

%N Consider the base-7 Kaprekar map n->K(n) defined in A165071. Sequence gives least elements of each cycle of length > 1.

%C Initial terms in base 7: 264, 3054, 40653, 320544, 5306532, 42166443, 530666532, 5316666432, 5431055322, 5440665222.

%H Joseph Myers, <a href="/A165082/b165082.txt">Table of n, a(n) for n=1..8989</a>

%H <a href="/index/K#Kaprekar_map">Index entries for the Kaprekar map</a>

%Y Cf. A165071, A165083, A165075, A165076, A165080, A165078, A165088.

%Y In other bases: Empty (base 2), A165004 (base 3), A165023 (base 4), A165043 (base 5), A165062 (base 6), A165101 (base 8), A165121 (base 9), A164720 (base 10).

%K base,nonn

%O 1,1

%A _Joseph Myers_, Sep 04 2009