A323951 - cp's OEIS frontend

A323951 Number of ways to split an n-cycle into connected subgraphs, all having at least three vertices.

n	a(n)
0	1
1	0
2	0
3	1
4	1
5	1
6	4
7	8
8	13
9	22
10	36
11	56
12	86
13	131
14	197
15	294
16	437
17	647
18	955
19	1407
20	2070
21	3042
22	4467
23	6556
24	9618
25	14106
26	20684
27	30325
28	44455
29	65164
30	95515
31	139997
32	205189
33	300733
34	440760
35	645980
36	946745
37	1387538
38	2033552
39	2980332
40	4367906
41	6401495
42	9381865
43	13749810

[1, 0, 0, 1, 1, 1, 4, 8, 13, 22, 36, 56, 86, 131, 197, 294, 437, 647, 955, 1407, 2070, 3042, 4467, 6556, 9618, 14106, 20684, 30325, 44455, 65164, 95515, 139997, 205189, 300733, 440760, 645980, 946745, 1387538, 2033552, 2980332, 4367906, 6401495, 9381865, 13749810]

cp's OEIS Frontend

A323951 Number of ways to split an n-cycle into connected subgraphs, all having at least three vertices.

Table of values

List of values