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.

A357082 a(0) = 0; for n > 0, a(n) is the smallest positive number not occurring earlier such that 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 1
2 2
3 3
4 4
5 5
6 10
7 6
8 9
9 7
10 17
11 12
12 20
13 13
14 16
15 18
16 11
17 21
18 15
19 19
20 23
21 38
22 26
23 8
24 24
25 37
26 27
27 34
28 30
29 31
30 33
31 32
32 40
33 36
34 28
35 44
36 41
37 35
38 29
39 43
40 39
41 25
42 47
43 53
44 51
45 49
46 42
47 22
48 50
49 14
50 58
51 46
52 54
53 62
54 65
55 63
56 66
57 67
58 61
59 68
60 60
61 69
62 59
63 70
64 74
65 55
66 73
67 56
68 72
69 57
70 71
71 75
72 78
73 76
74 52
75 77
76 92

List of values

[0, 1, 2, 3, 4, 5, 10, 6, 9, 7, 17, 12, 20, 13, 16, 18, 11, 21, 15, 19, 23, 38, 26, 8, 24, 37, 27, 34, 30, 31, 33, 32, 40, 36, 28, 44, 41, 35, 29, 43, 39, 25, 47, 53, 51, 49, 42, 22, 50, 14, 58, 46, 54, 62, 65, 63, 66, 67, 61, 68, 60, 69, 59, 70, 74, 55, 73, 56, 72, 57, 71, 75, 78, 76, 52, 77, 92]