|
|
A171813
|
|
Trajectory of 1 under repeated applications of the map i -> A171798(i).
|
|
7
|
|
|
1, 101, 734, 1037, 1174, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165, 1165
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
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.
|
|
LINKS
|
|
|
MATHEMATICA
|
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 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|