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.

A381597 Lexicographically earliest sequence of positive integers such that for any t and k, with k>=1, where t = a(n) = a(n+k) = a(n+2*k), only one occurrence of k, for a given t, appears anywhere in the sequence.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 1
7 2
8 1
9 2
10 2
11 2
12 1
13 1
14 2
15 1
16 1
17 3
18 2
19 3
20 2
21 1
22 3
23 1
24 2
25 3
26 2
27 2
28 1
29 3
30 3
31 2
32 1
33 2
34 3
35 3
36 3
37 1
38 1
39 4
40 1
41 2
42 3
43 4
44 3
45 1
46 3
47 1
48 4
49 4
50 2
51 3
52 2
53 2
54 4
55 3
56 4
57 2
58 4
59 4
60 2
61 1
62 4
63 1
64 3
65 2
66 2
67 4
68 5
69 3
70 1
71 3
72 3
73 1
74 4
75 4
76 2
77 4
78 4
79 3
80 1
81 1
82 2
83 3
84 3
85 2
86 5
87 5
88 3
89 5
90 2
91 1
92 3
93 4
94 5
95 4
96 1
97 5
98 4
99 3
100 1
101 2
102 4
103 1
104 4
105 1
106 5
107 2
108 2
109 3
110 3
111 5
112 5
113 5
114 4
115 5
116 1
117 4
118 3
119 2
120 5

List of values

[1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 1, 1, 3, 2, 3, 2, 1, 3, 1, 2, 3, 2, 2, 1, 3, 3, 2, 1, 2, 3, 3, 3, 1, 1, 4, 1, 2, 3, 4, 3, 1, 3, 1, 4, 4, 2, 3, 2, 2, 4, 3, 4, 2, 4, 4, 2, 1, 4, 1, 3, 2, 2, 4, 5, 3, 1, 3, 3, 1, 4, 4, 2, 4, 4, 3, 1, 1, 2, 3, 3, 2, 5, 5, 3, 5, 2, 1, 3, 4, 5, 4, 1, 5, 4, 3, 1, 2, 4, 1, 4, 1, 5, 2, 2, 3, 3, 5, 5, 5, 4, 5, 1, 4, 3, 2, 5]