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

Terms

a(0) =1a(1) =0a(2) =0a(3) =1a(4) =1a(5) =1a(6) =4a(7) =8a(8) =13a(9) =22a(10) =36a(11) =56a(12) =86a(13) =131a(14) =197a(15) =294a(16) =437a(17) =647a(18) =955a(19) =1407a(20) =2070a(21) =3042a(22) =4467a(23) =6556a(24) =9618a(25) =14106a(26) =20684a(27) =30325a(28) =44455a(29) =65164