A327117 - cp's OEIS frontend

A327117 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that a color pattern for part i has i distinct colors in 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	1
5	2
6	0
7	1
8	4
9	5
10	0
11	1
12	7
13	18
14	15
15	0
16	1
17	10
18	45
19	84
20	52
21	0
22	1
23	14
24	94
25	298
26	415
27	203
28	0
29	1
30	18
31	174
32	844
33	1995
34	2178
35	877
36	0
37	1
38	23
39	300
40	2081
41	7440
42	13638
43	12131
44	4140
45	0
46	1
47	28
48	486
49	4652
50	23670
51	64898
52	95823
53	71536
54	21147
55	0
56	1
57	34
58	756
59	9682
60	67390
61	259599
62	566447
63	694676
64	445356
65	115975

[1, 0, 1, 0, 1, 2, 0, 1, 4, 5, 0, 1, 7, 18, 15, 0, 1, 10, 45, 84, 52, 0, 1, 14, 94, 298, 415, 203, 0, 1, 18, 174, 844, 1995, 2178, 877, 0, 1, 23, 300, 2081, 7440, 13638, 12131, 4140, 0, 1, 28, 486, 4652, 23670, 64898, 95823, 71536, 21147, 0, 1, 34, 756, 9682, 67390, 259599, 566447, 694676, 445356, 115975]

cp's OEIS Frontend

A327117 Number T(n,k) of colored integer partitions of n using all colors of a k-set such that a color pattern for part i has i distinct colors in increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values