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

Terms

a(0) =6a(1) =96a(2) =290a(3) =744a(4) =1974a(5) =5376a(6) =15642a(7) =45480a(8) =124014a(9) =343008a(10) =944658a(11) =2596776a(12) =7116390a(13) =19409664a(14) =52694730a(15) =142812648a(16) =385840030a(17) =1039911520a(18) =2796034626a(19) =7501233256a(20) =20084164374a(21) =53677896192a(22) =143214557050a(23) =381504047912