_Joseph Myers (jsm(AT)polyomino.org.uk), _, Sep 04 2009
_Joseph Myers (jsm(AT)polyomino.org.uk), _, Sep 04 2009
<a href="/Sindx_index/K.html#Kaprekar_map">Index entries for the Kaprekar map</a>
Joseph Myers, <a href="/A165029/b165029.txt">Table of n, a(n) for n=1..7165</a>
<a href="/Sindx_K.html#Kaprekar_map">Index entries for the Kaprekar map</a>
base,nonn,new
a(n) = smallest number that leads to a new cycle under the base-4 Kaprekar map of A165012
0, 18, 65, 66, 257, 1025, 1039, 1050, 4097, 16385, 16386, 16399, 16447, 65537, 65551, 65898, 262145, 262146, 262207, 262239, 262399, 1048577, 1048578, 1048591, 1048639, 4194305, 4194310, 4194319, 4194399, 4194559, 4194687, 4195327
1,2
Initial terms in base 4: 0, 102, 1001, 1002, 10001, 100001, 100033, 100122, 1000001, 10000001.
Joseph Myers, <a href="b165029.txt">Table of n, a(n) for n=1..7165</a>
<a href="Sindx_K.html#Kaprekar_map">Index entries for the Kaprekar map</a>
base,nonn
Joseph Myers (jsm(AT)polyomino.org.uk), Sep 04 2009
approved