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.

A091799 a(1) = 3. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence so far. Then a(n+1) = max(k,3).

Table of values

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

List of values

[3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 4, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3]