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.

A360521 a(0) = 0; for n > 0, a(n) is the smallest positive number not occurring earlier such that neither the binary string a(n-1) + a(n) nor the same string reversed appear in the binary string concatenation of a(0)..a(n-1).

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 10, 6, 9, 7, 17, 15, 18, 14, 19, 13, 20, 12, 21, 11, 22, 26, 8, 24, 27, 37, 28, 23, 25, 39, 29, 35, 30, 34, 31, 33, 32, 36, 41, 44, 43, 42, 38, 62, 57, 70, 58, 69, 59, 68, 60, 67, 61, 66, 63, 64, 65, 71, 76, 52, 84, 72, 56, 80, 48, 88, 40, 96, 51, 77, 83, 45, 91, 81, 47, 89, 86]