Triangle read by rows giving the sum of the number of k-matchings of the graphs obtained by deleting one edge and its two vertices from the ladder graph L_n = P_2 X P_n in all possible ways.
A318243
Triangle read by rows giving the sum of the number of k-matchings of the graphs obtained by deleting one edge and its two vertices from the ladder graph L_n = P_2 X P_n in all possible ways.
Terms
- a(0) =1a(1) =4a(2) =4a(3) =7a(4) =22a(5) =9a(6) =10a(7) =58a(8) =78a(9) =20a(10) =13a(11) =112a(12) =282a(13) =224a(14) =40a(15) =16a(16) =184a(17) =702a(18) =1052a(19) =570a(20) =78a(21) =19a(22) =274a(23) =1419a(24) =3260a(25) =3335a(26) =1338a(27) =147a(28) =22a(29) =382
External references
- oeis: A318243