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.

A282167 a(n) is the minimal sum of a positive integer sequence of length n with no duplicate substrings (forward or backward) of length greater than 1, and no self-adjacent terms.

Table of values

n a(n)
1 1
2 3
3 6
4 7
5 11
6 13
7 17
8 19
9 25
10 27
11 31
12 35
13 39
14 45
15 47
16 53
17 57
18 63
19 67
20 73
21 77
22 83
23 87
24 95
25 99
26 105
27 111
28 117
29 123
30 129
31 135
32 141
33 149
34 153
35 161
36 167
37 175
38 181
39 189
40 195
41 203
42 209
43 217
44 223
45 231
46 237
47 247
48 253
49 261
50 269
51 277
52 285
53 293
54 301
55 309
56 317
57 325
58 333
59 341
60 351
61 357
62 367
63 375
64 385
65 393
66 403
67 411
68 421
69 429
70 439

List of values

[1, 3, 6, 7, 11, 13, 17, 19, 25, 27, 31, 35, 39, 45, 47, 53, 57, 63, 67, 73, 77, 83, 87, 95, 99, 105, 111, 117, 123, 129, 135, 141, 149, 153, 161, 167, 175, 181, 189, 195, 203, 209, 217, 223, 231, 237, 247, 253, 261, 269, 277, 285, 293, 301, 309, 317, 325, 333, 341, 351, 357, 367, 375, 385, 393, 403, 411, 421, 429, 439]