A364310 - cp's OEIS frontend

A364310 Number T(n,k) of partitions of n into k parts where each block of part i with multiplicity j is marked with a word of length i*j over an n-ary alphabet whose letters appear in alphabetical order and all n letters occur exactly once in the partition; 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	1
6	0
7	1
8	3
9	1
10	0
11	1
12	5
13	6
14	1
15	0
16	1
17	15
18	15
19	10
20	1
21	0
22	1
23	22
24	76
25	35
26	15
27	1
28	0
29	1
30	63
31	168
32	252
33	70
34	21
35	1
36	0
37	1
38	93
39	574
40	785
41	658
42	126
43	28
44	1
45	0
46	1
47	255
48	2188
49	3066
50	2739
51	1470
52	210
53	36
54	1
55	0
56	1
57	386
58	5490
59	18235
60	12181
61	7857
62	2940
63	330
64	45
65	1

[1, 0, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 5, 6, 1, 0, 1, 15, 15, 10, 1, 0, 1, 22, 76, 35, 15, 1, 0, 1, 63, 168, 252, 70, 21, 1, 0, 1, 93, 574, 785, 658, 126, 28, 1, 0, 1, 255, 2188, 3066, 2739, 1470, 210, 36, 1, 0, 1, 386, 5490, 18235, 12181, 7857, 2940, 330, 45, 1]

cp's OEIS Frontend

Table of values

List of values