A271708 - cp's OEIS frontend

A271708 Triangle read by rows, T(n,k) = Sum_{p in P(n,k)} Aut(p) where P(n,k) are the partitions of n with largest part k and Aut(p) = 1^j[1]j[1]!...n^j[n]j[n]! where j[m] is the number of parts in the partition p equal to m; for n>=0 and 0<=k<=n.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	2
6	0
7	6
8	2
9	3
10	0
11	24
12	12
13	3
14	4
15	0
16	120
17	20
18	12
19	4
20	5
21	0
22	720
23	112
24	42
25	16
26	5
27	6
28	0
29	5040
30	336
31	126
32	44
33	20
34	6
35	7
36	0
37	40320
38	2112
39	492
40	188
41	55
42	24
43	7
44	8
45	0
46	362880
47	11712
48	2802
49	640
50	215
51	66
52	28
53	8
54	9
55	0
56	3628800
57	92160
58	16938
59	3624
60	830
61	258
62	77
63	32
64	9
65	10

[1, 0, 1, 0, 2, 2, 0, 6, 2, 3, 0, 24, 12, 3, 4, 0, 120, 20, 12, 4, 5, 0, 720, 112, 42, 16, 5, 6, 0, 5040, 336, 126, 44, 20, 6, 7, 0, 40320, 2112, 492, 188, 55, 24, 7, 8, 0, 362880, 11712, 2802, 640, 215, 66, 28, 8, 9, 0, 3628800, 92160, 16938, 3624, 830, 258, 77, 32, 9, 10]

cp's OEIS Frontend

A271708 Triangle read by rows, T(n,k) = Sum_{p in P(n,k)} Aut(p) where P(n,k) are the partitions of n with largest part k and Aut(p) = 1^j[1]j[1]!...n^j[n]j[n]! where j[m] is the number of parts in the partition p equal to m; for n>=0 and 0<=k<=n.

Table of values

List of values

cp's OEIS Frontend

A271708 Triangle read by rows, T(n,k) = Sum_{p in P(n,k)} Aut(p) where P(n,k) are the partitions of n with largest part k and Aut(p) = 1^j[1]*j[1]!*...*n^j[n]*j[n]! where j[m] is the number of parts in the partition p equal to m; for n>=0 and 0<=k<=n.

Table of values

List of values

A271708 Triangle read by rows, T(n,k) = Sum_{p in P(n,k)} Aut(p) where P(n,k) are the partitions of n with largest part k and Aut(p) = 1^j[1]j[1]!...n^j[n]j[n]! where j[m] is the number of parts in the partition p equal to m; for n>=0 and 0<=k<=n.