Number of minimal dominating sets in the n-dipyramidal graph (for n > 3).

Terms

a(0) =3a(1) =7a(2) =10a(3) =15a(4) =16a(5) =18a(6) =29a(7) =31a(8) =40a(9) =48a(10) =67a(11) =82a(12) =105a(13) =143a(14) =189a(15) =255a(16) =341a(17) =474a(18) =647a(19) =892a(20) =1236a(21) =1719a(22) =2393a(23) =3330a(24) =4656a(25) =6503a(26) =9094a(27) =12719a(28) =17807a(29) =24931