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.

A034757 a(1)=1, a(n) = smallest odd number such that all sums of pairs of (not necessarily distinct) terms in the sequence are distinct.

Table of values

n a(n)
1 1
2 3
3 7
4 15
5 25
6 41
7 61
8 89
9 131
10 161
11 193
12 245
13 295
14 363
15 407
16 503
17 579
18 721
19 801
20 949
21 1129
22 1185
23 1323
24 1549
25 1643
26 1831
27 1939
28 2031
29 2317
30 2623
31 2789
32 3045
33 3143
34 3641
35 3791
36 4057
37 4507
38 4757
39 5019
40 5559
41 5849
42 6309
43 6707
44 7181
45 7593

List of values

[1, 3, 7, 15, 25, 41, 61, 89, 131, 161, 193, 245, 295, 363, 407, 503, 579, 721, 801, 949, 1129, 1185, 1323, 1549, 1643, 1831, 1939, 2031, 2317, 2623, 2789, 3045, 3143, 3641, 3791, 4057, 4507, 4757, 5019, 5559, 5849, 6309, 6707, 7181, 7593]