Number of minimal edge covers in the (2n-1)-triangular snake graph.

Terms

a(0) =0a(1) =3a(2) =7a(3) =17a(4) =44a(5) =112a(6) =285a(7) =726a(8) =1849a(9) =4709a(10) =11993a(11) =30544a(12) =77790a(13) =198117a(14) =504568a(15) =1285043a(16) =3272771a(17) =8335153a(18) =21228120a(19) =54064164a(20) =137691601a(21) =350675486a(22) =893106737a(23) =2274580561a(24) =5792943345a(25) =14753573988a(26) =37574671882a(27) =95695861097a(28) =243719968064a(29) =620710469107