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.

A062065 a(1) = 1; for n >= 1, a(n+1) is smallest number such that the sums of any one, two or three of a(1), ..., a(n) are distinct (repetitions not allowed).

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 15
6 28
7 52
8 96
9 165
10 278
11 460
12 663
13 980
14 1332
15 1864
16 2609
17 3375
18 4769
19 5600
20 6776
21 9141
22 11505
23 14453
24 17404
25 21904
26 25023
27 31159
28 35006
29 42780
30 51792
31 55799
32 68834
33 75036
34 87163
35 96746
36 116231
37 128924
38 144085
39 172606
40 193507
41 207826

List of values

[1, 2, 4, 8, 15, 28, 52, 96, 165, 278, 460, 663, 980, 1332, 1864, 2609, 3375, 4769, 5600, 6776, 9141, 11505, 14453, 17404, 21904, 25023, 31159, 35006, 42780, 51792, 55799, 68834, 75036, 87163, 96746, 116231, 128924, 144085, 172606, 193507, 207826]