Number of dominating subsets of the graph G(n) obtained by joining each vertex of the path graph P_{n+1} on n+1 vertices with an additional vertex (the join of K_1 and P_{n+1}).
A213663
Number of dominating subsets of the graph G(n) obtained by joining each vertex of the path graph P_{n+1} on n+1 vertices with an additional vertex (the join of K_1 and P_{n+1}).
Terms
- a(0) =7a(1) =13a(2) =25a(3) =49a(4) =95a(5) =185a(6) =361a(7) =705a(8) =1379a(9) =2701a(10) =5297a(11) =10401a(12) =20447a(13) =40241a(14) =79281a(15) =156353a(16) =308643a(17) =609813a(18) =1205881a(19) =2386481a(20) =4726463a(21) =9367401a(22) =18577497a(23) =36865665a(24) =73199171a(25) =145419549a(26) =289038817a(27) =574766401a(28) =1143442495a(29) =2275683169
External references
- oeis: A213663