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

Terms

a(0) =1a(1) =0a(2) =0a(3) =0a(4) =1a(5) =1a(6) =1a(7) =1a(8) =5a(9) =10a(10) =16a(11) =23a(12) =35a(13) =53a(14) =78a(15) =111a(16) =157a(17) =222a(18) =313a(19) =438a(20) =610a(21) =848a(22) =1178a(23) =1634a(24) =2263a(25) =3131a(26) =4330a(27) =5986a(28) =8272a(29) =11427