A276727 - cp's OEIS frontend

A276727 Number T(n,k) of set partitions of [n] where k is minimal such that for each block b the smallest integer interval containing b has at most k elements; 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	2
9	2
10	0
11	1
12	4
13	5
14	5
15	0
16	1
17	7
18	12
19	17
20	15
21	0
22	1
23	12
24	29
25	45
26	64
27	52
28	0
29	1
30	20
31	66
32	121
33	201
34	265
35	203
36	0
37	1
38	33
39	145
40	336
41	585
42	966
43	1197
44	877
45	0
46	1
47	54
48	315
49	901
50	1741
51	3172
52	4971
53	5852
54	4140
55	0
56	1
57	88
58	676
59	2347
60	5375
61	10100
62	18223
63	27267
64	30751
65	21147

[1, 0, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 4, 5, 5, 0, 1, 7, 12, 17, 15, 0, 1, 12, 29, 45, 64, 52, 0, 1, 20, 66, 121, 201, 265, 203, 0, 1, 33, 145, 336, 585, 966, 1197, 877, 0, 1, 54, 315, 901, 1741, 3172, 4971, 5852, 4140, 0, 1, 88, 676, 2347, 5375, 10100, 18223, 27267, 30751, 21147]

cp's OEIS Frontend

A276727 Number T(n,k) of set partitions of [n] where k is minimal such that for each block b the smallest integer interval containing b has at most k elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values