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.

A116624 a(1)=1; for n>1, a(n) = least positive integer not appearing earlier such that {a(k) | 1 <= k <= n} and {a(k) XOR a(k-1) | 1 <= k <= n} are disjoint sets of distinct numbers.

Table of values

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

List of values

[1, 2, 4, 8, 5, 10, 16, 7, 9, 17, 32, 11, 18, 33, 19, 35, 20, 34, 22, 40, 21, 41, 28, 36, 27, 64, 29, 38, 31, 37, 65, 30, 66, 39, 68, 42, 67, 44, 70, 45, 69, 128, 46, 72, 47, 77, 129, 71, 131, 73, 130, 74, 132, 75, 134, 79, 136, 80, 133, 81, 135, 84, 137, 82, 139, 85]