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.

A359858 a(0) = 0; for n > 0, a(n) is the smallest positive number not occurring earlier such that the ones' complement of the binary string of a(n-1) + a(n) does not appear in the binary string concatenation of a(0)..a(n-1).

Table of values

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

List of values

[0, 2, 6, 5, 3, 8, 14, 18, 20, 12, 24, 23, 9, 27, 37, 10, 22, 25, 7, 40, 39, 52, 42, 49, 15, 32, 59, 35, 56, 38, 53, 41, 50, 44, 47, 81, 13, 78, 16, 75, 57, 34, 94, 61, 30, 98, 60, 31, 97, 58, 33, 122, 63, 28, 127, 55, 36, 126, 65, 118, 67, 95, 88, 74, 109, 76, 86, 99, 84, 101, 82, 80, 103, 187]