Number of minimum connected dominating sets in the n-flower graph.

Terms

a(0) =1a(1) =9a(2) =6a(3) =219a(4) =20a(5) =1968a(6) =56a(7) =10779a(8) =144a(9) =52488a(10) =352a(11) =231984a(12) =832a(13) =977133a(14) =1920a(15) =3966699a(16) =4352a(17) =15720639a(18) =9728a(19) =61191312a(20) =21504a(21) =235009107a(22) =47104a(23) =893270016a(24) =102400a(25) =3367409412a(26) =221184a(27) =12609435873a(28) =475136a(29) =46953650535