The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A373092 The number of iterations of the map x -> A093653(x) that are required to reach from n to one of the fixed points, 1, 2, 3 or 6. 3
 0, 0, 0, 1, 1, 0, 2, 2, 2, 1, 2, 3, 2, 3, 3, 2, 1, 2, 2, 3, 3, 3, 2, 4, 1, 3, 3, 4, 2, 3, 1, 1, 3, 1, 3, 4, 2, 3, 2, 4, 2, 3, 2, 4, 4, 2, 1, 4, 3, 4, 3, 4, 2, 3, 3, 3, 2, 2, 1, 4, 1, 4, 2, 3, 3, 3, 2, 3, 2, 3, 2, 4, 2, 3, 3, 4, 3, 4, 1, 4, 4, 3, 2, 4, 3, 2, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 EXAMPLE The iterations for the n = 1..7 are: n a(n) iterations - ---- ----------- 1 0 1 2 0 2 3 0 3 4 1 4 -> 3 5 1 5 -> 3 6 0 6 7 2 7 -> 4 -> 3 MATHEMATICA d[n_] := DivisorSum[n, Plus @@ IntegerDigits[#, 2] &]; a[n_] := -2 + Length@ FixedPointList[d, n]; Array[a, 100] PROG (PARI) a(n) = {my(c = 0); while(6 % n, n = sumdiv(n, d, hammingweight(d)); c++); c; } CROSSREFS Cf. A086793 (decimal analog), A093653, A373093, A373094. Sequence in context: A006371 A000177 A319815 * A222656 A162545 A162544 Adjacent sequences: A373089 A373090 A373091 * A373093 A373094 A373095 KEYWORD nonn,easy,base AUTHOR Amiram Eldar, May 23 2024 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 05:51 EDT 2024. Contains 375059 sequences. (Running on oeis4.)