A326617 - cp's OEIS frontend

A326617 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), k>=0, k<=n<=A024916(k), read by columns.

n	a(n)
0	1
1	1
2	2
3	2
4	1
5	5
6	9
7	9
8	10
9	9
10	3
11	13
12	44
13	96
14	152
15	155
16	124
17	140
18	160
19	113
20	48
21	16
22	4
23	42
24	225
25	680
26	1350
27	2180
28	3751
29	6050
30	7420
31	6870
32	5555
33	5330
34	6300
35	6475
36	5025
37	3000
38	1250
39	250
40	150
41	1098
42	4155
43	11730
44	30300
45	69042
46	127364
47	188568
48	249690
49	365160
50	584733

[1, 1, 2, 2, 1, 5, 9, 9, 10, 9, 3, 13, 44, 96, 152, 155, 124, 140, 160, 113, 48, 16, 4, 42, 225, 680, 1350, 2180, 3751, 6050, 7420, 6870, 5555, 5330, 6300, 6475, 5025, 3000, 1250, 250, 150, 1098, 4155, 11730, 30300, 69042, 127364, 188568, 249690, 365160, 584733]

cp's OEIS Frontend

A326617 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), k>=0, k<=n<=A024916(k), read by columns.

Table of values

List of values