A326616 - cp's OEIS frontend

A326616 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that each block of part i with multiplicity j has a pattern of i*j distinct colors in increasing order; triangle T(n,k), n>=0, A185283(n)<=k<=n, read by rows.

n	a(n)
0	1
1	1
2	2
3	2
4	5
5	1
6	9
7	13
8	9
9	44
10	42
11	10
12	96
13	225
14	150
15	9
16	152
17	680
18	1098
19	576
20	3
21	155
22	1350
23	4155
24	5201
25	2266
26	124
27	2180
28	11730
29	26642
30	26904
31	9966
32	140
33	3751
34	30300
35	106281
36	182000
37	149832
38	47466
39	160
40	6050
41	69042
42	348061
43	896392
44	1229760
45	855240
46	237019

[1, 1, 2, 2, 5, 1, 9, 13, 9, 44, 42, 10, 96, 225, 150, 9, 152, 680, 1098, 576, 3, 155, 1350, 4155, 5201, 2266, 124, 2180, 11730, 26642, 26904, 9966, 140, 3751, 30300, 106281, 182000, 149832, 47466, 160, 6050, 69042, 348061, 896392, 1229760, 855240, 237019]

cp's OEIS Frontend

A326616 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that each block of part i with multiplicity j has a pattern of i*j distinct colors in increasing order; triangle T(n,k), n>=0, A185283(n)<=k<=n, read by rows.

Table of values

List of values