A189355 T(n,k) is the number of n X k array permutations with each element moving one space diagonally, horizontally or vertically.
0, 1, 1, 0, 4, 0, 1, 13, 13, 1, 0, 45, 48, 45, 0, 1, 160, 557, 557, 160, 1, 0, 565, 3632, 12592, 3632, 565, 0, 1, 2005, 30769, 237297, 237297, 30769, 2005, 1, 0, 7108, 229248, 4791913, 10252800, 4791913, 229248, 7108, 0, 1, 25209, 1815601, 94635005
Offset: 1
Examples
Some solutions for 5X3 ..1..0..5....4..5..1....4..0..5....4..5..1....3..5..1....1..2..5....3..2..5 ..6..3..2....7..0..2....6..1..2....0..8..2....0..8..2....0..7..8....0..1..4 ..7..8..4....3..6.11....3..8..7....3..6..7....9..4..7...10..3..4....9..8..7 .12.11.10...10.14..8...12.11.14...13.14.10...12..6.14...13..6.14...12..6.10 ..9.14.13....9.12.13...13..9.10....9.12.11...13.10.11....9.12.11...13.14.11
Links
- R. H. Hardin, Table of n, a(n) for n = 1..144
Crossrefs
Cf. A189186.
Comments