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

Terms

a(0) =1a(1) =1a(2) =1a(3) =2a(4) =6a(5) =12a(6) =23a(7) =44a(8) =82a(9) =149a(10) =267a(11) =475a(12) =841a(13) =1484a(14) =2613a(15) =4595a(16) =8074a(17) =14180a(18) =24896a(19) =43702a(20) =76705a(21) =134622a(22) =236260a(23) =414623a(24) =727629a(25) =1276917a(26) =2240851a(27) =3932438a(28) =6900967a(29) =12110373