A306418 - cp's OEIS frontend

A306418 Regular triangle read by rows where T(n, k) is the number of set partitions of {1, ..., n} requiring k steps of removing singletons and cyclical adjacency initiators until reaching a fixed point, n >= 0, 0 <= k <= n.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	0
6	0
7	2
8	3
9	0
10	1
11	2
12	12
13	0
14	0
15	0
16	12
17	35
18	5
19	0
20	0
21	5
22	56
23	100
24	42
25	0
26	0
27	0
28	14
29	282
30	343
31	231
32	7
33	0
34	0
35	0
36	66
37	1406
38	1476
39	1088
40	104
41	0
42	0
43	0
44	0
45	307
46	7592
47	7383
48	4929
49	909
50	27
51	0
52	0
53	0
54	0
55	1554
56	44227
57	40514
58	22950
59	6240
60	470
61	20
62	0
63	0
64	0
65	0

[1, 0, 1, 0, 2, 0, 0, 2, 3, 0, 1, 2, 12, 0, 0, 0, 12, 35, 5, 0, 0, 5, 56, 100, 42, 0, 0, 0, 14, 282, 343, 231, 7, 0, 0, 0, 66, 1406, 1476, 1088, 104, 0, 0, 0, 0, 307, 7592, 7383, 4929, 909, 27, 0, 0, 0, 0, 1554, 44227, 40514, 22950, 6240, 470, 20, 0, 0, 0, 0]

cp's OEIS Frontend

A306418 Regular triangle read by rows where T(n, k) is the number of set partitions of {1, ..., n} requiring k steps of removing singletons and cyclical adjacency initiators until reaching a fixed point, n >= 0, 0 <= k <= n.

Table of values

List of values