A327116 - cp's OEIS frontend

A327116 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	2
6	0
7	2
8	6
9	5
10	0
11	2
12	15
13	27
14	15
15	0
16	3
17	32
18	102
19	124
20	52
21	0
22	4
23	65
24	319
25	656
26	600
27	203
28	0
29	5
30	124
31	897
32	2780
33	4210
34	3084
35	877
36	0
37	6
38	230
39	2346
40	10305
41	23040
42	27567
43	16849
44	4140
45	0
46	8
47	414
48	5818
49	34864
50	108135
51	188284
52	186095
53	97640
54	21147

[1, 0, 1, 0, 1, 2, 0, 2, 6, 5, 0, 2, 15, 27, 15, 0, 3, 32, 102, 124, 52, 0, 4, 65, 319, 656, 600, 203, 0, 5, 124, 897, 2780, 4210, 3084, 877, 0, 6, 230, 2346, 10305, 23040, 27567, 16849, 4140, 0, 8, 414, 5818, 34864, 108135, 188284, 186095, 97640, 21147]

cp's OEIS Frontend

A327116 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values