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.

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

List of values

[0, 1, 2, 3, 4, 5, 10, 6, 7, 9, 14, 15, 16, 17, 18, 20, 12, 24, 8, 28, 26, 30, 22, 33, 11, 21, 31, 32, 36, 37, 27, 35, 41, 13, 23, 40, 44, 38, 62, 46, 66, 19, 42, 63, 65, 69, 39, 59, 60, 68, 72, 56, 57, 71, 76, 52, 53, 80, 48, 49, 55, 58, 61, 64, 83, 45, 73, 77, 81, 82, 85, 43, 50, 75, 79, 87, 51]