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.

A364871 a(n) = B(n) - A(n), where A(1) = 0, B(1) = 1, and sequences A and B are the lexicographically earliest sequences that start with their respective first terms and contain no term whose binary expansion is the concatenation of any two earlier terms in that sequence.

Table of values

n a(n)
1 1
2 1
3 0
4 0
5 3
6 -4
7 -2
8 -1
9 -1
10 4
11 3
12 4
13 8
14 8
15 11
16 11
17 11
18 1
19 2
20 -2
21 -1
22 -11
23 -11
24 -12
25 -12
26 -7
27 -8
28 -5
29 -1
30 -2
31 -2
32 2
33 -2
34 0
35 0
36 1
37 3
38 6
39 9
40 9
41 14
42 10
43 12
44 13
45 15
46 19
47 21
48 22
49 22
50 25
51 25
52 20
53 17
54 11
55 13
56 8
57 10
58 6
59 6
60 1
61 0
62 4
63 4
64 4
65 9
66 8
67 8
68 1
69 1
70 1
71 1
72 -6
73 -12
74 -11
75 -15
76 -21
77 -18
78 -20

List of values

[1, 1, 0, 0, 3, -4, -2, -1, -1, 4, 3, 4, 8, 8, 11, 11, 11, 1, 2, -2, -1, -11, -11, -12, -12, -7, -8, -5, -1, -2, -2, 2, -2, 0, 0, 1, 3, 6, 9, 9, 14, 10, 12, 13, 15, 19, 21, 22, 22, 25, 25, 20, 17, 11, 13, 8, 10, 6, 6, 1, 0, 4, 4, 4, 9, 8, 8, 1, 1, 1, 1, -6, -12, -11, -15, -21, -18, -20]