|
%I #4 Mar 30 2016 12:09:16
%S 1,101,734,1037,1174,1165,1165,1165,1165,1165,1165,1165,1165,1165,
%T 1165,1165,1165,1165,1165,1165,1165,1165,1165,1165,1165,1165,1165,
%U 1165,1165,1165,1165,1165,1165,1165,1165,1165,1165,1165,1165,1165
%N Trajectory of 1 under repeated applications of the map i -> A171798(i).
%C Start with n, repeatedly apply the map i -> A171798(i). Then every n converges to one of 1019, 1147, 1165 or 14311. Proof: this is true by direct calculation for n=1..2^14. For larger n, A171798(n) < n.
%t ans[n_]:=Module[{idn2=IntegerDigits[n,2]},FromDigits[{Length[ idn2], Count[ idn2,0], Count[ idn2,1]}]]; NestList[ans,1,40] (* _Harvey P. Dale_, Mar 30 2016 *)
%Y Cf. A171798.
%K nonn,base
%O 1,2
%A _N. J. A. Sloane_, Oct 15 2010, Oct 16 2010
|
