A323950 - cp's OEIS frontend

A323950 Number of ways to split an n-cycle into connected subgraphs, none having exactly two vertices.

n	a(n)
0	1
1	1
2	1
3	2
4	6
5	12
6	23
7	44
8	82
9	149
10	267
11	475
12	841
13	1484
14	2613
15	4595
16	8074
17	14180
18	24896
19	43702
20	76705
21	134622
22	236260
23	414623
24	727629
25	1276917
26	2240851
27	3932438
28	6900967
29	12110373
30	21252244
31	37295110
32	65448378
33	114853920
34	201554603
35	353703696
36	620706742

[1, 1, 1, 2, 6, 12, 23, 44, 82, 149, 267, 475, 841, 1484, 2613, 4595, 8074, 14180, 24896, 43702, 76705, 134622, 236260, 414623, 727629, 1276917, 2240851, 3932438, 6900967, 12110373, 21252244, 37295110, 65448378, 114853920, 201554603, 353703696, 620706742]

cp's OEIS Frontend

A323950 Number of ways to split an n-cycle into connected subgraphs, none having exactly two vertices.

Table of values

List of values