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.

A175872 Write n in binary. Consider the 0's and 1 as a list. (*) If the new list consists entirely of 1's, then a(n) = the number of 1's, and end. Otherwise, construct a new list made up of the lengths, written in order, of the runs of similarly-valued terms from the previous list. Go to *.

Table of values

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

List of values

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