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.

A101274 a(1)=1; for n>1, a(n) is the smallest positive integer such that the set of all sums of adjacent elements up to and including a(n) contains no number more than once.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 8
6 10
7 14
8 21
9 15
10 16
11 26
12 25
13 34
14 22
15 48
16 38
17 71
18 40
19 74
20 90
21 28
22 69
23 113
24 47
25 94
26 54
27 46
28 143
29 153
30 83
31 128
32 49
33 249
34 75
35 133
36 225
37 125
38 131
39 270
40 145
41 230
42 199
43 237
44 206
45 201
46 299
47 136
48 346
49 72
50 272
51 120
52 55
53 453
54 247
55 376
56 427
57 124
58 535
59 87
60 242
61 431
62 283
63 227
64 212
65 940
66 318
67 387
68 311
69 391
70 325

List of values

[1, 2, 4, 5, 8, 10, 14, 21, 15, 16, 26, 25, 34, 22, 48, 38, 71, 40, 74, 90, 28, 69, 113, 47, 94, 54, 46, 143, 153, 83, 128, 49, 249, 75, 133, 225, 125, 131, 270, 145, 230, 199, 237, 206, 201, 299, 136, 346, 72, 272, 120, 55, 453, 247, 376, 427, 124, 535, 87, 242, 431, 283, 227, 212, 940, 318, 387, 311, 391, 325]