A323953 - cp's OEIS frontend

A323953 Regular triangle read by rows where T(n, k) is the number of ways to split an n-cycle into singletons and connected subsequences of sizes > k.

n	a(n)
1	1
2	2
3	1
4	5
5	2
6	1
7	12
8	6
9	2
10	1
11	27
12	12
13	7
14	2
15	1
16	58
17	23
18	14
19	8
20	2
21	1
22	121
23	44
24	23
25	16
26	9
27	2
28	1
29	248
30	82
31	38
32	26
33	18
34	10
35	2
36	1
37	503
38	149
39	65
40	38
41	29
42	20
43	11
44	2
45	1
46	1014
47	267
48	112
49	57
50	42
51	32
52	22
53	12
54	2
55	1
56	2037
57	475
58	189
59	90
60	57
61	46
62	35
63	24
64	13
65	2
66	1

[1, 2, 1, 5, 2, 1, 12, 6, 2, 1, 27, 12, 7, 2, 1, 58, 23, 14, 8, 2, 1, 121, 44, 23, 16, 9, 2, 1, 248, 82, 38, 26, 18, 10, 2, 1, 503, 149, 65, 38, 29, 20, 11, 2, 1, 1014, 267, 112, 57, 42, 32, 22, 12, 2, 1, 2037, 475, 189, 90, 57, 46, 35, 24, 13, 2, 1]

cp's OEIS Frontend

A323953 Regular triangle read by rows where T(n, k) is the number of ways to split an n-cycle into singletons and connected subsequences of sizes > k.

Table of values

List of values