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.

A247185 a(0) = 0. a(n) is the number of repeating sums in the collection of all sums of two elements in [a(0), ... a(n-1)], chosen without replacement.

Table of values

n a(n)
0 0
1 0
2 0
3 2
4 4
5 6
6 9
7 11
8 16
9 19
10 22
11 26
12 32
13 38
14 43
15 50
16 56
17 67
18 75
19 81
20 89
21 97
22 109
23 119
24 130
25 140
26 154
27 166
28 178
29 194
30 205
31 220
32 233
33 250
34 264
35 283
36 296
37 312
38 327
39 345
40 359
41 378
42 397
43 415
44 432
45 456
46 481
47 504
48 523
49 547
50 569
51 591
52 617
53 641
54 664
55 689
56 718
57 744
58 769
59 797
60 824
61 847
62 878
63 910
64 945

List of values

[0, 0, 0, 2, 4, 6, 9, 11, 16, 19, 22, 26, 32, 38, 43, 50, 56, 67, 75, 81, 89, 97, 109, 119, 130, 140, 154, 166, 178, 194, 205, 220, 233, 250, 264, 283, 296, 312, 327, 345, 359, 378, 397, 415, 432, 456, 481, 504, 523, 547, 569, 591, 617, 641, 664, 689, 718, 744, 769, 797, 824, 847, 878, 910, 945]