A326500 - cp's OEIS frontend

A326500 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 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	2
5	2
6	0
7	3
8	8
9	5
10	0
11	5
12	22
13	30
14	13
15	0
16	7
17	54
18	129
19	124
20	42
21	0
22	11
23	118
24	428
25	696
26	525
27	150
28	0
29	15
30	248
31	1293
32	3108
33	3830
34	2358
35	576
36	0
37	22
38	490
39	3483
40	11595
41	20720
42	20535
43	10661
44	2266
45	0
46	30
47	950
48	9102
49	40592
50	99140
51	141234
52	117362
53	52824
54	9966

[1, 0, 1, 0, 2, 2, 0, 3, 8, 5, 0, 5, 22, 30, 13, 0, 7, 54, 129, 124, 42, 0, 11, 118, 428, 696, 525, 150, 0, 15, 248, 1293, 3108, 3830, 2358, 576, 0, 22, 490, 3483, 11595, 20720, 20535, 10661, 2266, 0, 30, 950, 9102, 40592, 99140, 141234, 117362, 52824, 9966]

cp's OEIS Frontend

A326500 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 colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values