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.

A361640 a(0) = 0, a(1) = 1; thereafter let b be the least power of 2 that does not appear in the binary expansions of a(n-2) and a(n-1), then a(n) is the smallest multiple of b that is not yet in the sequence.

Table of values

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

List of values

[0, 1, 2, 4, 3, 8, 12, 5, 6, 16, 7, 24, 32, 9, 10, 20, 11, 64, 28, 13, 14, 48, 15, 128, 80, 17, 18, 36, 19, 40, 44, 21, 22, 56, 23, 192, 72, 25, 26, 52, 27, 256, 60, 29, 30, 96, 31, 384, 160, 33, 34, 68, 35, 88, 76, 37, 38, 104, 39, 112, 120, 41, 42, 84, 43]