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 a horizontal edge.
A325754
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 a horizontal edge.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =2a(4) =0a(5) =1a(6) =7a(7) =4a(8) =4a(9) =0a(10) =43a(11) =38a(12) =21a(13) =2a(14) =1a(15) =372a(16) =360a(17) =168a(18) =36a(19) =9a(20) =0a(21) =4027a(22) =3972a(23) =1818a(24) =478a(25) =93a(26) =6a(27) =1a(28) =51871a(29) =51444
External references
- oeis: A325754