A188962 T(n,k)=Number of nXk array permutations with each element moved by a city block distance of no more than three.
1, 2, 2, 6, 24, 6, 24, 720, 720, 24, 78, 24024, 229080, 24024, 78, 230, 570050, 75764664, 75764664, 570050, 230, 675, 12702057, 17316382188, 251096032912, 17316382188, 12702057, 675, 2069, 298167456, 3909049448304, 573780546403024
Offset: 1
Examples
Some solutions for 5X3 ..0..5..1....0..5..1....0..5..1....0..5..1....0..5..1....0..5..1....0..5..1 ..6..3.10....6..3.10....6..3.10....6..3..7....6..3..7....6..3..7....6..3..7 ..7..2.14...13..7.11....9.14..7....8..2.13...10..2.11....4.14..2...11.13..2 .11..4..9....8..4..2....8..4..2...14..4..9...13..8..4....8..9.10...14..4.10 .13..8.12...12.14..9...13.11.12...11.12.10...12.14..9...11.13.12...12..9..8
Links
- R. H. Hardin, Table of n, a(n) for n = 1..39
Crossrefs
Column 1 is A002526
Comments