A261137 - cp's OEIS frontend

A261137 Number of set partitions B'_t(n) of {1,2,...,t} into at most n parts, so that no part contains both 1 and t, or both i and i+1 with 1 <= i < t; triangle B'_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	3
14	4
15	0
16	0
17	0
18	5
19	10
20	11
21	0
22	0
23	1
24	11
25	31
26	40
27	41
28	0
29	0
30	0
31	21
32	91
33	147
34	161
35	162
36	0
37	0
38	1
39	43
40	274
41	568
42	694
43	714
44	715
45	0
46	0
47	0
48	85
49	820
50	2227
51	3151
52	3397
53	3424
54	3425
55	0
56	0
57	1
58	171
59	2461
60	8824
61	14851
62	17251
63	17686
64	17721
65	17722

[1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 3, 4, 0, 0, 0, 5, 10, 11, 0, 0, 1, 11, 31, 40, 41, 0, 0, 0, 21, 91, 147, 161, 162, 0, 0, 1, 43, 274, 568, 694, 714, 715, 0, 0, 0, 85, 820, 2227, 3151, 3397, 3424, 3425, 0, 0, 1, 171, 2461, 8824, 14851, 17251, 17686, 17721, 17722]

cp's OEIS Frontend

A261137 Number of set partitions B'_t(n) of {1,2,...,t} into at most n parts, so that no part contains both 1 and t, or both i and i+1 with 1 <= i < t; triangle B'_t(n), t>=0, 0<=n<=t, read by rows.

Table of values

List of values