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.

A357433 a(1) = 1; a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier such that the binary string of a(n) plus the sum of all previous terms appears in the binary string concatenation of a(1)..a(n-1).

Table of values

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

List of values

[1, 2, 3, 5, 12, 4, 9, 10, 11, 16, 14, 6, 7, 18, 17, 13, 15, 8, 20, 22, 24, 33, 26, 31, 21, 19, 25, 35, 30, 28, 56, 34, 36, 43, 32, 42, 37, 23, 29, 38, 27, 58, 45, 60, 46, 52, 44, 50, 72, 53, 54, 41, 65, 47, 40, 48, 66, 51, 64, 49, 57, 61, 67, 93, 77, 59, 74, 100, 75, 69, 91, 73, 83, 71, 81, 39, 82]