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.

A280430 Longest word T from 2 equal length strings S using no breakpoint reuse.

Table of values

n a(n)
0 2
1 4
2 7
3 14
4 19
5 34
6 63
7 76
8 137
9 248
10 282
11 502
12 891
13 980
14 1718
15 3000
16 3233
17 5594
18 9646
19 10256
20 17565
21 30000
22 31597
23 53690
24 91033
25 95214
26 160803
27 271108
28 282054
29 474060
30 795677
31 824334
32 1380142
33 2308114
34 2383139
35 3977364
36 6631898
37 6828316
38 11366227

List of values

[2, 4, 7, 14, 19, 34, 63, 76, 137, 248, 282, 502, 891, 980, 1718, 3000, 3233, 5594, 9646, 10256, 17565, 30000, 31597, 53690, 91033, 95214, 160803, 271108, 282054, 474060, 795677, 824334, 1380142, 2308114, 2383139, 3977364, 6631898, 6828316, 11366227]