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.

A329173 Smallest positive integer such that for any n no substring (subsequence without internal skips) of length n is repeated unless it contains the number n or higher.

Table of values

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

List of values

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