A364285 - cp's OEIS frontend

A364285 Number T(n,k) of partitions of n with largest part k 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	7
13	4
14	1
15	0
16	1
17	15
18	20
19	5
20	1
21	0
22	1
23	31
24	81
25	30
26	6
27	1
28	0
29	1
30	63
31	287
32	175
33	42
34	7
35	1
36	0
37	1
38	127
39	952
40	841
41	280
42	56
43	8
44	1
45	0
46	1
47	255
48	3025
49	4545
50	1638
51	420
52	72
53	9
54	1
55	0
56	1
57	511
58	9370
59	23820
60	10333
61	2730
62	600
63	90
64	10
65	1

[1, 0, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 7, 4, 1, 0, 1, 15, 20, 5, 1, 0, 1, 31, 81, 30, 6, 1, 0, 1, 63, 287, 175, 42, 7, 1, 0, 1, 127, 952, 841, 280, 56, 8, 1, 0, 1, 255, 3025, 4545, 1638, 420, 72, 9, 1, 0, 1, 511, 9370, 23820, 10333, 2730, 600, 90, 10, 1]

cp's OEIS Frontend

Table of values

List of values