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.

A175096 Write n in binary (without leading 0's). a(n) = the number of distinct numerical values made by permutating the runs of 0's and the runs of 1's, such that the runs (of nonzero length) of 1's alternate with the runs (of nonzero length) of 0's. The permutated binary numbers (those not equal to n) may start with leading 0's.

Table of values

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

List of values

[1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 4, 2, 4, 1, 4, 2, 2, 2, 4, 1, 2, 2, 2, 1, 2, 1, 4, 2, 2, 2, 8, 2, 4, 2, 2, 3, 8, 3, 4, 2, 2, 2, 8, 1, 8, 3, 2, 2, 2, 2, 4, 2, 2, 2, 2, 1, 2, 1, 4, 2, 4, 2, 8, 2, 4, 1, 6, 6, 4, 6, 8, 2, 4, 2, 6, 6, 6, 1, 6, 3, 8, 6, 6, 3, 8, 3, 4, 2, 2, 2, 8, 1, 4, 6, 4, 2, 8, 6]