A189650 T(n,k) = Number of n X k array permutations with each element moving zero or one space horizontally, diagonally or antidiagonally.
1, 2, 1, 3, 9, 1, 5, 33, 32, 1, 8, 185, 263, 121, 1, 13, 913, 4277, 2161, 450, 1, 21, 4777, 55440, 107080, 17655, 1681, 1, 34, 24577, 799069, 3774889, 2631821, 144353, 6272, 1, 55, 127385, 11047585, 157346785, 250758892, 64890337, 1180167, 23409, 1, 89
Offset: 1
Examples
Some solutions for 5X3 ..0..2..1....0..1..2....1..0..4....0..3..2....0..1..2....4..0..2....0..5..2 ..3..4..5....4..3..5....3..2..5....1..5..4....3..4..5....1..6..5....1..3..4 ..6.11..8....6..8..7....6..8..7....7..6..8....7..6..8....7..3..8....6..9..8 ..7..9.10....9.14.13....9.12.11....9.10.11...10.14.11....9.14.13....7.10.13 .12.14.13...12.11.10...10.14.13...12.14.13...12..9.13...12.11.10...12.11.14
Links
- R. H. Hardin, Table of n, a(n) for n = 1..144
Comments