A188966 T(n,k)=Number of nXk array permutations with each element moved and moved by a city block distance of no more than three.
0, 1, 1, 2, 9, 2, 9, 265, 265, 9, 24, 8132, 78976, 8132, 24, 57, 154564, 22666641, 22666641, 154564, 57, 140, 2790864, 4064659324, 62394485617, 4064659324, 2790864, 140, 376, 55327556, 741295637637, 109564294856817, 109564294856817
Offset: 1
Examples
Some solutions for 5X3 ..1..0..3....1..0..3....1..0..3....1..0..3....1..0..3....1..0..3....1..0..3 ..2..7..6....2..7..8....2..7..6....2..7..8....2..7..8....2..7..8....2..7..8 ..8..5.13....4.14.10....8.14..5....9..6..5...12..4.13....4..9.13....5.10..4 .14.12..4...13..5..6...13.11..4...13.14..4....6..9.14...11.14..5...12..9..6 .10..9.11....9.11.12...10.12..9...10.12.11...11.10..5...10..6.12...11.14.13
Links
- R. H. Hardin, Table of n, a(n) for n = 1..39
Crossrefs
Column 1 is A079997
Comments