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.

A091975 a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of is of the form xy^(k_1)Y^(k_2)y^(k_3)Y^(k_4)...y^(k_(m-1))Y^(k_m) where y has positive length and Y=reverse(y) and k_1+k_2+k_3+...+k_m = k.

Table of values

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

List of values

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