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.

A180094 Number of steps to reach 0 or 1, starting with n and applying the map k -> (number of 1's in binary expansion of k) repeatedly.

Table of values

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

List of values

[0, 0, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 2, 1, 2, 2, 3, 2, 3, 3, 2, 2, 3, 3, 2, 3, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 3, 3, 2, 3, 2, 2, 3, 3, 2, 2, 3, 2, 3, 3, 3, 1, 2, 2, 3, 2, 3, 3, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 3, 3, 2, 3, 2, 2, 3, 3, 2, 2, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3]