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.

A297825 a(n) is the (negative) length of the final string after iteratively removing all runs from the binary string 11011100...n (formed by concatenating the first n binary numbers, see A058935(n)).

Table of values

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

List of values

[1, -1, -1, -1, -4, -2, -2, -2, -2, 2, 4, 4, 2, 3, 3, 3, 3, 4, 5, 7, 2, 4, 6, 6, 7, 6, 5, 5, 5, 5, 5, 5, 5, 6, 7, 6, 4, 6, 7, 9, 7, 1, -3, -2, -1, -1, 0, 0, 1, 2, 2, 0, 3, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 2, 1, 1, -2, 0, 1, 3, 1, 0, -2, -6, 1, -2, -5, -4, -4, -3, -4, -4, -3, -3, -3, -3, -4, -5, -5, -6]