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.

A358918 a(0) = 0, and for any n >= 0, a(n+1) is the length of the longest run of consecutive terms a(i), ..., a(j) with 0 <= i <= j <= n such that a(i) XOR ... a(j) = a(n) (where XOR denotes the bitwise XOR operator).

Table of values

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

List of values

[0, 1, 2, 1, 2, 4, 6, 2, 7, 9, 1, 6, 7, 9, 12, 9, 12, 13, 14, 17, 1, 14, 17, 18, 20, 18, 20, 22, 26, 18, 20, 28, 30, 26, 22, 28, 30, 30, 32, 3, 28, 30, 32, 3, 28, 38, 40, 22, 34, 46, 26, 41, 31, 45, 42, 40, 37, 41, 31, 58, 60, 53, 54, 57, 57, 57, 57, 57, 57, 57]