A306351 - cp's OEIS frontend

A306351 Number of ways to split an n-cycle into connected subgraphs all having at least 4 vertices.

n	a(n)
0	1
1	0
2	0
3	0
4	1
5	1
6	1
7	1
8	5
9	10
10	16
11	23
12	35
13	53
14	78
15	111
16	157
17	222
18	313
19	438
20	610
21	848
22	1178
23	1634
24	2263
25	3131
26	4330
27	5986
28	8272
29	11427
30	15782
31	21794
32	30093
33	41548
34	57359
35	79183
36	109307
37	150887
38	208279
39	287496
40	396838
41	547761
42	756077
43	1043611
44	1440488
45	1988289

[1, 0, 0, 0, 1, 1, 1, 1, 5, 10, 16, 23, 35, 53, 78, 111, 157, 222, 313, 438, 610, 848, 1178, 1634, 2263, 3131, 4330, 5986, 8272, 11427, 15782, 21794, 30093, 41548, 57359, 79183, 109307, 150887, 208279, 287496, 396838, 547761, 756077, 1043611, 1440488, 1988289]

cp's OEIS Frontend

A306351 Number of ways to split an n-cycle into connected subgraphs all having at least 4 vertices.

Table of values

List of values