Number of minimum edge covers in the n-dipyramidal graph.

Terms

a(0) =1a(1) =2a(2) =21a(3) =8a(4) =85a(5) =18a(6) =217a(7) =32a(8) =441a(9) =50a(10) =781a(11) =72a(12) =1261a(13) =98a(14) =1905a(15) =128a(16) =2737a(17) =162a(18) =3781a(19) =200a(20) =5061a(21) =242a(22) =6601a(23) =288a(24) =8425a(25) =338a(26) =10557a(27) =392a(28) =13021a(29) =450