A339030 - cp's OEIS frontend

A339030 T(n, k) = Sum_{p in P(n, k)} card(p), where P(n, k) is the set of set partitions of {1,2,...,n} where the largest block has size k and card(p) is the number of blocks of p. Triangle T(n, k) for 0 <= k <= n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	1
6	0
7	3
8	6
9	1
10	0
11	4
12	24
13	8
14	1
15	0
16	5
17	85
18	50
19	10
20	1
21	0
22	6
23	300
24	280
25	75
26	12
27	1
28	0
29	7
30	1071
31	1540
32	525
33	105
34	14
35	1
36	0
37	8
38	3976
39	8456
40	3570
41	840
42	140
43	16
44	1
45	0
46	9
47	15219
48	47208
49	24381
50	6552
51	1260
52	180
53	18
54	1

[1, 0, 1, 0, 2, 1, 0, 3, 6, 1, 0, 4, 24, 8, 1, 0, 5, 85, 50, 10, 1, 0, 6, 300, 280, 75, 12, 1, 0, 7, 1071, 1540, 525, 105, 14, 1, 0, 8, 3976, 8456, 3570, 840, 140, 16, 1, 0, 9, 15219, 47208, 24381, 6552, 1260, 180, 18, 1]

cp's OEIS Frontend

A339030 T(n, k) = Sum_{p in P(n, k)} card(p), where P(n, k) is the set of set partitions of {1,2,...,n} where the largest block has size k and card(p) is the number of blocks of p. Triangle T(n, k) for 0 <= k <= n, read by rows.

Table of values

List of values