Number of minimal total dominating sets in the n-path graph.

Terms

a(0) =0a(1) =1a(2) =2a(3) =1a(4) =2a(5) =4a(6) =3a(7) =4a(8) =8a(9) =9a(10) =10a(11) =16a(12) =21a(13) =25a(14) =36a(15) =49a(16) =60a(17) =81a(18) =112a(19) =144a(20) =189a(21) =256a(22) =336a(23) =441a(24) =592a(25) =784a(26) =1029a(27) =1369a(28) =1820a(29) =2401