A326914 - cp's OEIS frontend

A326914 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 distinct colors in increasing order; triangle T(n,k), n>=0, min(j:A001787(j)>=n)<=k<=n, read by rows.

n	a(n)
0	1
1	1
2	2
3	2
4	5
5	1
6	12
7	15
8	18
9	64
10	52
11	20
12	166
13	340
14	203
15	18
16	332
17	1315
18	1866
19	877
20	15
21	566
22	3895
23	9930
24	10710
25	4140
26	11
27	864
28	9770
29	39960
30	74438
31	64520
32	21147
33	6
34	1214
35	21848
36	134871
37	386589
38	564508
39	408096
40	115975
41	3
42	1596
43	44880
44	402756
45	1668338
46	3652712

[1, 1, 2, 2, 5, 1, 12, 15, 18, 64, 52, 20, 166, 340, 203, 18, 332, 1315, 1866, 877, 15, 566, 3895, 9930, 10710, 4140, 11, 864, 9770, 39960, 74438, 64520, 21147, 6, 1214, 21848, 134871, 386589, 564508, 408096, 115975, 3, 1596, 44880, 402756, 1668338, 3652712]

cp's OEIS Frontend

A326914 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 distinct colors in increasing order; triangle T(n,k), n>=0, min(j:A001787(j)>=n)<=k<=n, read by rows.

Table of values

List of values