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.

A126428 a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) such that pairwise sums and (absolute) differences of distinct elements are all distinct.

Table of values

n a(n)
1 1
2 2
3 6
4 12
5 21
6 37
7 58
8 84
9 112
10 129
11 173
12 213
13 266
14 307
15 373
16 446
17 513
18 589
19 639
20 829
21 916
22 1061
23 1209
24 1297
25 1429
26 1461
27 1626
28 1783
29 1964
30 2220
31 2576
32 2653
33 2875
34 3064
35 3307
36 3605
37 3889
38 4228
39 4332
40 4412
41 4658
42 5337
43 5618
44 5647
45 6281
46 6511
47 7001
48 7388

List of values

[1, 2, 6, 12, 21, 37, 58, 84, 112, 129, 173, 213, 266, 307, 373, 446, 513, 589, 639, 829, 916, 1061, 1209, 1297, 1429, 1461, 1626, 1783, 1964, 2220, 2576, 2653, 2875, 3064, 3307, 3605, 3889, 4228, 4332, 4412, 4658, 5337, 5618, 5647, 6281, 6511, 7001, 7388]