A236970 - cp's OEIS frontend

A236970 The number of partitions of n into at least 3 parts from which we can form every partition of n into 3 parts by summing elements.

n	a(n)
1	0
2	0
3	1
4	2
5	2
6	3
7	5
8	6
9	7
10	13
11	16
12	19
13	29
14	38
15	49
16	72
17	84
18	108
19	155
20	195
21	234
22	331
23	410
24	501
25	672
26	824
27	1006
28	1341
29	1621
30	1981
31	2583
32	3111
33	3740
34	4846
35	5819
36	6957
37	8787
38	10582
39	12606
40	15840
41	18762
42	22386
43	27851
44	32934
45	38824
46	47961
47	56633
48	66577
49	81168
50	95612

[0, 0, 1, 2, 2, 3, 5, 6, 7, 13, 16, 19, 29, 38, 49, 72, 84, 108, 155, 195, 234, 331, 410, 501, 672, 824, 1006, 1341, 1621, 1981, 2583, 3111, 3740, 4846, 5819, 6957, 8787, 10582, 12606, 15840, 18762, 22386, 27851, 32934, 38824, 47961, 56633, 66577, 81168, 95612]

cp's OEIS Frontend

A236970 The number of partitions of n into at least 3 parts from which we can form every partition of n into 3 parts by summing elements.

Table of values

List of values