Number of dominating subsets with k vertices in all the graphs G(n) (n>=1) obtained by taking n copies of the path P_3 and identifying one of their endpoints (a star with n branches of length 2).
A213667
Number of dominating subsets with k vertices in all the graphs G(n) (n>=1) obtained by taking n copies of the path P_3 and identifying one of their endpoints (a star with n branches of length 2).
Terms
- a(0) =1a(1) =6a(2) =16a(3) =40a(4) =98a(5) =238a(6) =576a(7) =1392a(8) =3362a(9) =8118a(10) =19600a(11) =47320a(12) =114242a(13) =275806a(14) =665856a(15) =1607520a(16) =3880898a(17) =9369318a(18) =22619536a(19) =54608392a(20) =131836322a(21) =318281038a(22) =768398400a(23) =1855077840a(24) =4478554082a(25) =10812186006a(26) =26102926096a(27) =63018038200a(28) =152139002498a(29) =367296043198
External references
- oeis: A213667