Triangle read by rows giving the number of configurations of n indistinguishable pairs placed on the vertices of the ladder graph P_2 X P_n such that exactly k such pairs are joined by an edge.
A325753
Triangle read by rows giving the number of configurations of n indistinguishable pairs placed on the vertices of the ladder graph P_2 X P_n such that exactly k such pairs are joined by an edge.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =2a(6) =2a(7) =8a(8) =2a(9) =3a(10) =21a(11) =34a(12) =39a(13) =6a(14) =5a(15) =186a(16) =347a(17) =250a(18) =138a(19) =16a(20) =8a(21) =2113a(22) =3666a(23) =2919a(24) =1234a(25) =414a(26) =36a(27) =13a(28) =27856a(29) =47484
External references
- oeis: A325753