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.

A359506 a(n) is the least integer m such that there exists a strictly increasing integer sequence n = b_1 < b_2 < ... < b_t = m with the property that b_1 XOR b_2 XOR ... XOR b_t = 0.

Table of values

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

List of values

[0, 3, 5, 6, 7, 10, 9, 12, 11, 14, 13, 20, 15, 18, 17, 24, 19, 22, 21, 28, 23, 26, 25, 40, 27, 30, 29, 36, 31, 34, 33, 48, 35, 38, 37, 44, 39, 42, 41, 56, 43, 46, 45, 52, 47, 50, 49, 80, 51, 54, 53, 60, 55, 58, 57, 72, 59, 62, 61, 68, 63, 66, 65, 96, 67]