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.

A375776 Bitwise conflict-free sequence: Each number n is placed into the first set k that contains no element x where n AND x > 0: a(n) = k.

Table of values

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

List of values

[1, 1, 2, 1, 3, 4, 5, 1, 4, 3, 6, 2, 7, 8, 9, 1, 8, 7, 10, 6, 11, 12, 13, 5, 14, 15, 16, 17, 18, 19, 20, 1, 12, 11, 17, 10, 15, 14, 21, 13, 22, 23, 24, 25, 26, 27, 28, 2, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 1, 19, 18, 25, 16, 23, 22, 36, 10, 30, 29, 32]