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.

A236971 Number of partitions of n into at least 4 parts from which we can form every partition of n into 4 parts by summing elements.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 2
6 2
7 3
8 3
9 6
10 7
11 8
12 11
13 19
14 21
15 26
16 31
17 52
18 66
19 76
20 88
21 134
22 169
23 215
24 251
25 358
26 412
27 517
28 639
29 899
30 1065
31 1242
32 1496
33 2072
34 2482
35 2930
36 3449
37 4677
38 5566

List of values

[0, 0, 0, 1, 2, 2, 3, 3, 6, 7, 8, 11, 19, 21, 26, 31, 52, 66, 76, 88, 134, 169, 215, 251, 358, 412, 517, 639, 899, 1065, 1242, 1496, 2072, 2482, 2930, 3449, 4677, 5566]