A350684 - cp's OEIS frontend

A350684 Number T(n,k) of partitions of [n] such that the sum of elements i contained in block i equals k when blocks are ordered with decreasing largest elements; triangle T(n,k), n>=0, 0<=k<=max(0,A008805(n-1)), read by rows.

n	a(n)
0	1
1	0
2	1
3	1
4	1
5	1
6	1
7	2
8	1
9	6
10	3
11	4
12	2
13	16
14	7
15	8
16	14
17	3
18	3
19	1
20	73
21	25
22	26
23	51
24	12
25	12
26	4
27	298
28	91
29	92
30	164
31	116
32	56
33	30
34	21
35	4
36	4
37	1
38	1453
39	390
40	391
41	601
42	676
43	256
44	163
45	147
46	28
47	28
48	7
49	7366
50	1797
51	1798
52	2484
53	3228
54	1927
55	897
56	876
57	307
58	307
59	87
60	31
61	31
62	5
63	5
64	1

[1, 0, 1, 1, 1, 1, 1, 2, 1, 6, 3, 4, 2, 16, 7, 8, 14, 3, 3, 1, 73, 25, 26, 51, 12, 12, 4, 298, 91, 92, 164, 116, 56, 30, 21, 4, 4, 1, 1453, 390, 391, 601, 676, 256, 163, 147, 28, 28, 7, 7366, 1797, 1798, 2484, 3228, 1927, 897, 876, 307, 307, 87, 31, 31, 5, 5, 1]

cp's OEIS Frontend

A350684 Number T(n,k) of partitions of [n] such that the sum of elements i contained in block i equals k when blocks are ordered with decreasing largest elements; triangle T(n,k), n>=0, 0<=k<=max(0,A008805(n-1)), read by rows.

Table of values

List of values