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

Terms

a(0) =1a(1) =6a(2) =24a(3) =74a(4) =180a(5) =464a(6) =1113a(7) =2646a(8) =6360a(9) =15222a(10) =36795a(11) =89584a(12) =219635a(13) =542320a(14) =1346881a(15) =3361998a(16) =8427172a(17) =21195416a(18) =53455740a(19) =135112332a(20) =342093443a(21) =867325032a(22) =2201286622a(23) =5591469852a(24) =14211796995a(25) =36139507614a(26) =91934054637a(27) =233934039872a(28) =595393224041