A309973 - cp's OEIS frontend

A309973 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that parts i have distinct color patterns in arbitrary order and each pattern for a 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	3
6	0
7	2
8	6
9	10
10	0
11	2
12	21
13	42
14	47
15	0
16	3
17	42
18	177
19	264
20	246
21	0
22	4
23	90
24	619
25	1746
26	2095
27	1602
28	0
29	5
30	176
31	1809
32	7556
33	16085
34	16608
35	11481
36	0
37	6
38	348
39	5211
40	32621
41	100030
42	171480
43	154385
44	95503
45	0
46	8
47	640
48	13961
49	120964
50	522890
51	1262832
52	1842659
53	1503232
54	871030

[1, 0, 1, 0, 1, 3, 0, 2, 6, 10, 0, 2, 21, 42, 47, 0, 3, 42, 177, 264, 246, 0, 4, 90, 619, 1746, 2095, 1602, 0, 5, 176, 1809, 7556, 16085, 16608, 11481, 0, 6, 348, 5211, 32621, 100030, 171480, 154385, 95503, 0, 8, 640, 13961, 120964, 522890, 1262832, 1842659, 1503232, 871030]

cp's OEIS Frontend

A309973 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that parts i have distinct color patterns in arbitrary order and each pattern for a 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