A261139 - cp's OEIS frontend

A261139 S'_t(n) is the number of set partitions of {1,2,...,t} into exactly n parts such that no part contains both 1 and t or both i and i+1 for some i with 1 <= i < t; triangle S'_t(n), t >= 0, 0 <= n <= t, read by rows.

n	a(n)
0	1
1	0
2	0
3	0
4	0
5	1
6	0
7	0
8	0
9	1
10	0
11	0
12	1
13	2
14	1
15	0
16	0
17	0
18	5
19	5
20	1
21	0
22	0
23	1
24	10
25	20
26	9
27	1
28	0
29	0
30	0
31	21
32	70
33	56
34	14
35	1
36	0
37	0
38	1
39	42
40	231
41	294
42	126
43	20
44	1
45	0
46	0
47	0
48	85
49	735
50	1407
51	924
52	246
53	27
54	1
55	0
56	0
57	1
58	170
59	2290
60	6363
61	6027
62	2400
63	435
64	35
65	1

[1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 2, 1, 0, 0, 0, 5, 5, 1, 0, 0, 1, 10, 20, 9, 1, 0, 0, 0, 21, 70, 56, 14, 1, 0, 0, 1, 42, 231, 294, 126, 20, 1, 0, 0, 0, 85, 735, 1407, 924, 246, 27, 1, 0, 0, 1, 170, 2290, 6363, 6027, 2400, 435, 35, 1]

cp's OEIS Frontend

A261139 S'_t(n) is the number of set partitions of {1,2,...,t} into exactly n parts such that no part contains both 1 and t or both i and i+1 for some i with 1 <= i < t; triangle S'_t(n), t >= 0, 0 <= n <= t, read by rows.

Table of values

List of values