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.

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

Table of values

n a(n)
0 0
1 1
2 3
3 5
4 9
5 17
6 7
7 23
8 2
9 12
10 22
11 6
12 16
13 37
14 58
15 10
16 38
17 4
18 32
19 60
20 14
21 48
22 82
23 8
24 42
25 85
26 15
27 61
28 107
29 11
30 67
31 131
32 18
33 86
34 13
35 77
36 141
37 21
38 89
39 25
40 93
41 20
42 84
43 148
44 19
45 83
46 147
47 27
48 91
49 155
50 26
51 90
52 154
53 24
54 88
55 152
56 28
57 92
58 156
59 36
60 100
61 164
62 30
63 94
64 158
65 29
66 142
67 78
68 191
69 31
70 95
71 159

List of values

[0, 1, 3, 5, 9, 17, 7, 23, 2, 12, 22, 6, 16, 37, 58, 10, 38, 4, 32, 60, 14, 48, 82, 8, 42, 85, 15, 61, 107, 11, 67, 131, 18, 86, 13, 77, 141, 21, 89, 25, 93, 20, 84, 148, 19, 83, 147, 27, 91, 155, 26, 90, 154, 24, 88, 152, 28, 92, 156, 36, 100, 164, 30, 94, 158, 29, 142, 78, 191, 31, 95, 159]