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.

A247186 a(0) = 0. a(n) is the number of repeating sums in the collection of all sums formed from [a(0), ... a(n-1)] + [a(0), ... a(n-1)].

Table of values

n a(n)
0 0
1 0
2 2
3 3
4 4
5 7
6 9
7 12
8 16
9 20
10 25
11 31
12 34
13 42
14 48
15 53
16 62
17 71
18 79
19 88
20 98
21 105
22 116
23 128
24 136
25 146
26 157
27 169
28 182
29 195
30 210
31 228
32 245
33 259
34 272
35 289
36 306
37 322
38 343
39 362
40 376
41 395
42 412
43 436
44 454
45 478
46 493
47 509
48 530
49 555
50 578
51 602
52 631
53 652
54 678
55 708
56 732
57 759
58 783
59 808
60 837
61 870
62 895

List of values

[0, 0, 2, 3, 4, 7, 9, 12, 16, 20, 25, 31, 34, 42, 48, 53, 62, 71, 79, 88, 98, 105, 116, 128, 136, 146, 157, 169, 182, 195, 210, 228, 245, 259, 272, 289, 306, 322, 343, 362, 376, 395, 412, 436, 454, 478, 493, 509, 530, 555, 578, 602, 631, 652, 678, 708, 732, 759, 783, 808, 837, 870, 895]