Triangle read by rows: T(n,k) is the number of k-matchings in the C_n X P_3 graph (C_n is the cycle graph on n vertices and P_3 is the path graph on 3 vertices).
A102089
Triangle read by rows: T(n,k) is the number of k-matchings in the C_n X P_3 graph (C_n is the cycle graph on n vertices and P_3 is the path graph on 3 vertices).
Terms
- a(0) =1a(1) =10a(2) =24a(3) =12a(4) =1a(5) =15a(6) =69a(7) =107a(8) =36a(9) =1a(10) =20a(11) =142a(12) =440a(13) =588a(14) =288a(15) =32a(16) =1a(17) =25a(18) =240a(19) =1125a(20) =2710a(21) =3227a(22) =1645a(23) =240a(24) =1a(25) =30a(26) =363a(27) =2290a(28) =8139a(29) =16446
External references
- oeis: A102089