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.

A352199 a(0)=0, a(1)=1, a(2)=2; thereafter, a(n) is smallest number m not yet in the sequence such that the binary expansions of m and a(n-2) have a 1 in common, but the 1's in m are disjoint from the 1's in a(n-1) and a(n-3).

Table of values

n a(n)
0 0
1 1
2 2
3 5
4 10
5 4
6 8
7 20
8 9
9 6
10 33
11 18
12 32
13 14
14 96
15 3
16 48
17 7
18 16
19 11
20 80
21 12
22 64
23 13
24 66
25 17
26 34
27 21
28 40
29 65
30 42
31 68
32 24
33 69
34 26
35 36
36 130
37 37
38 74
39 49
40 72
41 52
42 136
43 19
44 128
45 22
46 160
47 15
48 192
49 23
50 224
51 25
52 288
53 27
54 100
55 129
56 260
57 131
58 28
59 35
60 76
61 161
62 84
63 162
64 88

List of values

[0, 1, 2, 5, 10, 4, 8, 20, 9, 6, 33, 18, 32, 14, 96, 3, 48, 7, 16, 11, 80, 12, 64, 13, 66, 17, 34, 21, 40, 65, 42, 68, 24, 69, 26, 36, 130, 37, 74, 49, 72, 52, 136, 19, 128, 22, 160, 15, 192, 23, 224, 25, 288, 27, 100, 129, 260, 131, 28, 35, 76, 161, 84, 162, 88]