A321878 - cp's OEIS frontend

A321878 Number T(n,k) of partitions of n into colored blocks of equal parts, such that all colors from a set of size k are used and the colors are introduced in increasing order; triangle T(n,k), n>=0, 0<=k<=A003056(n), read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	0
6	3
7	1
8	0
9	5
10	2
11	0
12	7
13	5
14	0
15	11
16	9
17	1
18	0
19	15
20	17
21	2
22	0
23	22
24	28
25	5
26	0
27	30
28	47
29	10
30	0
31	42
32	74
33	21
34	1
35	0
36	56
37	116
38	37
39	2
40	0
41	77
42	175
43	67
44	5
45	0
46	101
47	263
48	112
49	10
50	0
51	135
52	385
53	187
54	20
55	0
56	176
57	560
58	302
59	40
60	1
61	0
62	231
63	800
64	479
65	72
66	2
67	0
68	297
69	1135
70	741
71	127
72	5

[1, 0, 1, 0, 2, 0, 3, 1, 0, 5, 2, 0, 7, 5, 0, 11, 9, 1, 0, 15, 17, 2, 0, 22, 28, 5, 0, 30, 47, 10, 0, 42, 74, 21, 1, 0, 56, 116, 37, 2, 0, 77, 175, 67, 5, 0, 101, 263, 112, 10, 0, 135, 385, 187, 20, 0, 176, 560, 302, 40, 1, 0, 231, 800, 479, 72, 2, 0, 297, 1135, 741, 127, 5]

cp's OEIS Frontend

A321878 Number T(n,k) of partitions of n into colored blocks of equal parts, such that all colors from a set of size k are used and the colors are introduced in increasing order; triangle T(n,k), n>=0, 0<=k<=A003056(n), read by rows.

Table of values

List of values