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.

A010672 A B_2 sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct.

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 7
5 12
6 20
7 29
8 38
9 52
10 73
11 94
12 127
13 151
14 181
15 211
16 257
17 315
18 373
19 412
20 475
21 530
22 545
23 607
24 716
25 797
26 861
27 964
28 1059
29 1160
30 1306
31 1385
32 1434
33 1555
34 1721
35 1833
36 1933
37 2057
38 2260
39 2496
40 2698
41 2873
42 3060
43 3196
44 3331
45 3628
46 3711
47 3867
48 4139
49 4446
50 4639

List of values

[0, 1, 2, 4, 7, 12, 20, 29, 38, 52, 73, 94, 127, 151, 181, 211, 257, 315, 373, 412, 475, 530, 545, 607, 716, 797, 861, 964, 1059, 1160, 1306, 1385, 1434, 1555, 1721, 1833, 1933, 2057, 2260, 2496, 2698, 2873, 3060, 3196, 3331, 3628, 3711, 3867, 4139, 4446, 4639]