A216800 T(n,k)=Number of permutations of an nXk array with each element moving exactly one horizontally or vertically and without 2-loops.
0, 0, 0, 0, 2, 0, 0, 2, 2, 0, 0, 6, 0, 6, 0, 0, 10, 8, 8, 10, 0, 0, 22, 0, 88, 0, 22, 0, 0, 42, 32, 292, 292, 32, 42, 0, 0, 86, 0, 1774, 0, 1774, 0, 86, 0, 0, 170, 128, 7676, 10140, 10140, 7676, 128, 170, 0, 0, 342, 0, 39844, 0, 207408, 0, 39844, 0, 342, 0, 0, 682, 512, 186996
Offset: 1
Examples
Some solutions for n=4 k=4 ..1..5..3..7....1..5..3..7....4..0..1..2....1..5..3..7....4..0..1..2 ..0..9..2..6....0..4..2..6....8..6..7..3....0..4..2..6....5..6..7..3 ..4.13.11.15....9.13.11.15...12..5..9.10...12..8.14.10...12..8..9.10 ..8.12.10.14....8.12.10.14...13.14.15.11...13..9.15.11...13.14.15.11
Links
- R. H. Hardin, Table of n, a(n) for n = 1..312
Comments