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.

A080430 a(n) = least odd number such that all pairwise sums a(i) + a(j), i < j <= n, are distinct.

Table of values

n a(n)
1 1
2 3
3 5
4 9
5 15
6 25
7 41
8 59
9 77
10 105
11 147
12 189
13 255
14 303
15 363
16 423
17 515
18 631
19 747
20 825
21 951
22 1061
23 1091
24 1215
25 1433
26 1595
27 1723
28 1929
29 2119
30 2321
31 2613
32 2771
33 2869
34 3111
35 3443
36 3667
37 3867
38 4115
39 4521
40 4993
41 5397
42 5747
43 6121
44 6393
45 6663
46 7257
47 7423
48 7735
49 8279

List of values

[1, 3, 5, 9, 15, 25, 41, 59, 77, 105, 147, 189, 255, 303, 363, 423, 515, 631, 747, 825, 951, 1061, 1091, 1215, 1433, 1595, 1723, 1929, 2119, 2321, 2613, 2771, 2869, 3111, 3443, 3667, 3867, 4115, 4521, 4993, 5397, 5747, 6121, 6393, 6663, 7257, 7423, 7735, 8279]