A326962 - cp's OEIS frontend

A326962 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), k>=0, k<=n<=k*2^(k-1), read by columns.

n	a(n)
0	1
1	1
2	2
3	2
4	1
5	5
6	12
7	18
8	20
9	18
10	15
11	11
12	6
13	3
14	1
15	15
16	64
17	166
18	332
19	566
20	864
21	1214
22	1596
23	1975
24	2320
25	2600
26	2780
27	2842
28	2780
29	2600
30	2320
31	1979
32	1608
33	1238
34	908
35	626
36	404
37	246
38	136
39	69
40	32
41	12
42	4
43	1
44	52
45	340
46	1315
47	3895
48	9770
49	21848
50	44880
51	86275
52	157140

[1, 1, 2, 2, 1, 5, 12, 18, 20, 18, 15, 11, 6, 3, 1, 15, 64, 166, 332, 566, 864, 1214, 1596, 1975, 2320, 2600, 2780, 2842, 2780, 2600, 2320, 1979, 1608, 1238, 908, 626, 404, 246, 136, 69, 32, 12, 4, 1, 52, 340, 1315, 3895, 9770, 21848, 44880, 86275, 157140]

cp's OEIS Frontend

A326962 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), k>=0, k<=n<=k*2^(k-1), read by columns.

Table of values

List of values