%I #4 Mar 30 2012 17:28:43
%S 0,126,41958
%N Consider the base-4 Kaprekar map x->K(x) described in A165012. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n
%C Known values (to 200 base-4 digits):
%C a(1) = 0 (base 10) = 0 (base 4)
%C a(2) = 126 (base 10) = 1332 (base 4)
%C a(3) = 41958 (base 10) = 22033212 (base 4)
%H <a href="/index/K#Kaprekar_map">Index entries for the Kaprekar map</a>
%Y Cf. A165012, A165016, A165017, A165019, A165021, A165023.
%Y In other bases: A153881 (base 2), A165008 (base 3), A165047 (base 5), A165067 (base 6), A165086 (base 7), A165106 (base 8), A165126 (base 9), A151959 (base 10).
%K base,nonn,bref
%O 1,2
%A _Joseph Myers_, Sep 04 2009
|