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.

A247184 a(0) = 0. a(n) is the number of distinct sums of two elements in [a(0), ... a(n-1)] chosen without replacement.

Table of values

n a(n)
0 0
1 0
2 1
3 2
4 4
5 7
6 11
7 15
8 20
9 26
10 32
11 40
12 48
13 57
14 65
15 73
16 81
17 90
18 98
19 106
20 114
21 123
22 132
23 147
24 157
25 170
26 190
27 202
28 223
29 236
30 251
31 270
32 291
33 314
34 338
35 361
36 380
37 398
38 421
39 443
40 471
41 495
42 520
43 544
44 567
45 592
46 616
47 639
48 663
49 692
50 720
51 749
52 781
53 819
54 852
55 885
56 913
57 948
58 987
59 1023
60 1055
61 1088

List of values

[0, 0, 1, 2, 4, 7, 11, 15, 20, 26, 32, 40, 48, 57, 65, 73, 81, 90, 98, 106, 114, 123, 132, 147, 157, 170, 190, 202, 223, 236, 251, 270, 291, 314, 338, 361, 380, 398, 421, 443, 471, 495, 520, 544, 567, 592, 616, 639, 663, 692, 720, 749, 781, 819, 852, 885, 913, 948, 987, 1023, 1055, 1088]