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.

A175599 The difference between maximal run length and minimal run length in binary representation of n.

Table of values

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

List of values

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