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.

A352200 a(0)=0, a(1)=1; thereafter, a(n) is the smallest number m not yet in the sequence such that the binary expansions of m and a(n-1) have a 1 in the same position, but the positions of the 1's in the binary expansions of m and a(n-2) are disjoint, except that the second condition is ignored if it would imply that no choice for m were possible.

Table of values

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

List of values

[0, 1, 3, 2, 6, 4, 5, 9, 8, 10, 7, 17, 16, 18, 11, 12, 20, 19, 33, 32, 34, 14, 13, 49, 48, 21, 15, 40, 96, 64, 65, 23, 22, 24, 41, 35, 66, 68, 28, 25, 67, 38, 36, 29, 26, 98, 37, 129, 128, 130, 27, 44, 100, 80, 144, 131, 39, 52, 88, 72, 30, 50, 97, 69, 132, 136, 42, 51, 81, 76, 46, 146, 145, 45, 70, 82, 56, 137, 71, 54, 152, 73, 99, 134, 140, 57]