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.

A340488 a(n+1) = XOR(a(n),y) for n>=1, where y is the number of m < n such that a(m) = a(n); a(1)=0.

Table of values

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

List of values

[0, 0, 1, 1, 0, 2, 2, 3, 3, 2, 0, 3, 1, 3, 0, 4, 4, 5, 5, 4, 6, 6, 7, 7, 6, 4, 7, 5, 7, 4, 0, 5, 6, 5, 1, 2, 1, 5, 0, 6, 2, 6, 3, 7, 3, 6, 0, 7, 2, 7, 1, 4, 1, 7, 0, 8, 8, 9, 9, 8, 10, 10, 11, 11, 10, 8, 11, 9, 11, 8, 12, 12, 13, 13, 12, 14, 14]