cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A376615 a(n) is the number of iterations that n requires to reach a noninteger under the map x -> x / wt(x), where wt(k) is the binary weight of k (A000120); a(n) = 0 if n is a power of 2.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 2
7 1
8 0
9 1
10 2
11 1
12 3
13 1
14 1
15 1
16 0
17 1
18 2
19 1
20 3
21 2
22 1
23 1
24 4
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 0
33 1
34 2
35 1
36 3
37 1
38 1
39 1
40 4
41 1
42 2
43 1
44 1
45 1
46 1
47 1
48 5
49 1
50 1
51 1
52 1
53 1
54 1
55 2
56 1
57 1
58 1
59 1
60 2
61 1
62 1
63 1
64 0
65 1
66 2
67 1
68 3
69 2
70 1
71 1
72 4
73 1
74 1
75 1
76 1
77 1
78 1
79 1
80 5
81 2
82 1
83 1
84 2
85 1
86 1
87 1
88 1
89 1
90 1
91 1
92 2
93 1
94 1
95 1
96 6
97 1
98 1
99 1
100 1
101 1
102 1
103 1
104 1
105 1

List of values

[0, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 3, 1, 1, 1, 0, 1, 2, 1, 3, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 3, 1, 1, 1, 4, 1, 2, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 0, 1, 2, 1, 3, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 5, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1]