A188981 T(n,k)=Number of nXk array permutations with each element moved but moved no more than a city block distance of two.
0, 1, 1, 2, 9, 2, 4, 116, 116, 4, 6, 900, 7264, 900, 6, 13, 7836, 295264, 295264, 7836, 13, 24, 71865, 12838276, 54113236, 12838276, 71865, 24, 45, 640513, 577290185, 10523263424, 10523263424, 577290185, 640513, 45, 84, 5706113, 25631148992
Offset: 1
Examples
Some solutions for 5X3 ..1..0..4....1..0..4....1..0..4....1..0..4....1..0..4....1..0..4....1..0..4 ..6..2.11....5..6..7....6..8..2....6..8..2....5..3.11....6..5..8....5..2..3 .12..3..5...12..3..2....3.11.14...12..9..5....8.10..2....9..3..2....8.10.14 .13..9..7...11.13..9...13.12..5....3..7.10...13..7..9...10.14..7...11..6.13 .14.10..8...14.10..8....9..7.10...14.11.13....6.14.12...13.12.11....9..7.12
Links
- R. H. Hardin, Table of n, a(n) for n = 1..59
Crossrefs
Column 1 is A033305
Comments