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.

A282166 a(n) is the minimal sum of a positive integer sequence of length n with no duplicate substrings of length greater than 1, and every number different from its neighbors.

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 8
6 12
7 13
8 17
9 18
10 22
11 24
12 28
13 30
14 35
15 37
16 42
17 44
18 49
19 51
20 56
21 59
22 64
23 67
24 72
25 75
26 81
27 84
28 90
29 93
30 99
31 102
32 108
33 111
34 117
35 121
36 127
37 131
38 137
39 141
40 147
41 151
42 158
43 162
44 169
45 173
46 180
47 184
48 191
49 195
50 202
51 206
52 213
53 218
54 225
55 230
56 237
57 242
58 249
59 254
60 261
61 266
62 274
63 279
64 287
65 292
66 300
67 305
68 313
69 318
70 326
71 331
72 339
73 344
74 352
75 358
76 366
77 372
78 380
79 386
80 394

List of values

[1, 3, 4, 7, 8, 12, 13, 17, 18, 22, 24, 28, 30, 35, 37, 42, 44, 49, 51, 56, 59, 64, 67, 72, 75, 81, 84, 90, 93, 99, 102, 108, 111, 117, 121, 127, 131, 137, 141, 147, 151, 158, 162, 169, 173, 180, 184, 191, 195, 202, 206, 213, 218, 225, 230, 237, 242, 249, 254, 261, 266, 274, 279, 287, 292, 300, 305, 313, 318, 326, 331, 339, 344, 352, 358, 366, 372, 380, 386, 394]