Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2, read by rows, where T(n,k) is the number of 2*(k+2)-cycles in the n X n grid graph which pass through NW corner (0,0).

A333651

Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2, read by rows, where T(n,k) is the number of 2*(k+2)-cycles in the n X n grid graph which pass through NW corner (0,0).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =4a(4) =1a(5) =2a(6) =6a(7) =18a(8) =40a(9) =24a(10) =6a(11) =1a(12) =2a(13) =6a(14) =20a(15) =72a(16) =248a(17) =698a(18) =1100a(19) =1096a(20) =662a(21) =206a(22) =1a(23) =2a(24) =6a(25) =20a(26) =74a(27) =298a(28) =1228a(29) =4762

External references