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.

A281511 The lexicographically earliest sequence of positive integers such that for all k >= j >= 1, if a(n) = a(n + j) = a(n + k) then a(n + j + k) != a(n).

Table of values

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

List of values

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