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.

A364670 Number of strict integer partitions of n with a part equal to the sum of two distinct others. A variation of sum-full strict partitions.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 1
9 0
10 3
11 1
12 4
13 3
14 7
15 6
16 10
17 10
18 14
19 16
20 24
21 25
22 34
23 39
24 48
25 59
26 71
27 81
28 103
29 120
30 136
31 166
32 194
33 226
34 260
35 312
36 353
37 419
38 473
39 557
40 636
41 742
42 824
43 974
44 1097
45 1266
46 1418
47 1646
48 1837
49 2124
50 2356
51 2717
52 3029
53 3469
54 3830
55 4383
56 4884
57 5547

List of values

[0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 3, 1, 4, 3, 7, 6, 10, 10, 14, 16, 24, 25, 34, 39, 48, 59, 71, 81, 103, 120, 136, 166, 194, 226, 260, 312, 353, 419, 473, 557, 636, 742, 824, 974, 1097, 1266, 1418, 1646, 1837, 2124, 2356, 2717, 3029, 3469, 3830, 4383, 4884, 5547]