A339031 - cp's OEIS frontend

A339031 T(n, k) = k*P(n, k), where P(n, k) is the number of partitions of an n-set with k blocks, the largest of which has the size n - k + 1. Triangle T(n, k) for 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	6
9	3
10	0
11	1
12	8
13	18
14	4
15	0
16	1
17	10
18	30
19	40
20	5
21	0
22	1
23	12
24	45
25	80
26	75
27	6
28	0
29	1
30	14
31	63
32	140
33	175
34	126
35	7
36	0
37	1
38	16
39	84
40	224
41	350
42	336
43	196
44	8
45	0
46	1
47	18
48	108
49	336
50	630
51	756
52	588
53	288
54	9

[1, 0, 1, 0, 1, 2, 0, 1, 6, 3, 0, 1, 8, 18, 4, 0, 1, 10, 30, 40, 5, 0, 1, 12, 45, 80, 75, 6, 0, 1, 14, 63, 140, 175, 126, 7, 0, 1, 16, 84, 224, 350, 336, 196, 8, 0, 1, 18, 108, 336, 630, 756, 588, 288, 9]

cp's OEIS Frontend

A339031 T(n, k) = k*P(n, k), where P(n, k) is the number of partitions of an n-set with k blocks, the largest of which has the size n - k + 1. Triangle T(n, k) for 0 <= k <= n, read by rows.

Table of values

List of values

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	2
6	0
7	1
8	6
9	3
10	0
11	1
12	8
13	18
14	4
15	0
16	1
17	10
18	30
19	40
20	5
21	0
22	1
23	12
24	45
25	80
26	75
27	6
28	0
29	1
30	14
31	63
32	140
33	175
34	126
35	7
36	0
37	1
38	16
39	84
40	224
41	350
42	336
43	196
44	8
45	0
46	1
47	18
48	108
49	336
50	630
51	756
52	588
53	288
54	9

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	2
6	0
7	1
8	6
9	3
10	0
11	1
12	8
13	18
14	4
15	0
16	1
17	10
18	30
19	40
20	5
21	0
22	1
23	12
24	45
25	80
26	75
27	6
28	0
29	1
30	14
31	63
32	140
33	175
34	126
35	7
36	0
37	1
38	16
39	84
40	224
41	350
42	336
43	196
44	8
45	0
46	1
47	18
48	108
49	336
50	630
51	756
52	588
53	288
54	9

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	2
6	0
7	1
8	6
9	3
10	0
11	1
12	8
13	18
14	4
15	0
16	1
17	10
18	30
19	40
20	5
21	0
22	1
23	12
24	45
25	80
26	75
27	6
28	0
29	1
30	14
31	63
32	140
33	175
34	126
35	7
36	0
37	1
38	16
39	84
40	224
41	350
42	336
43	196
44	8
45	0
46	1
47	18
48	108
49	336
50	630
51	756
52	588
53	288
54	9