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.

A259280 a(n) is the minimal sum of a positive integer sequence of length n with no duplicate substrings of length greater than 1.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 7
6 9
7 11
8 14
9 16
10 19
11 21
12 24
13 27
14 30
15 33
16 36
17 40
18 43
19 47
20 50
21 54
22 57
23 61
24 65
25 69
26 73
27 77
28 81
29 85
30 90
31 94
32 99
33 103
34 108
35 112
36 117
37 121
38 126
39 131
40 136
41 141
42 146
43 151
44 156
45 161
46 166
47 172
48 177
49 183
50 188
51 194
52 199
53 205
54 210
55 216
56 221
57 227
58 233
59 239
60 245

List of values

[1, 2, 4, 5, 7, 9, 11, 14, 16, 19, 21, 24, 27, 30, 33, 36, 40, 43, 47, 50, 54, 57, 61, 65, 69, 73, 77, 81, 85, 90, 94, 99, 103, 108, 112, 117, 121, 126, 131, 136, 141, 146, 151, 156, 161, 166, 172, 177, 183, 188, 194, 199, 205, 210, 216, 221, 227, 233, 239, 245]