A189449 T(n,k)=Number of nXk array permutations with each element moving zero or one space horizontally or diagonally.
1, 2, 1, 3, 5, 1, 5, 16, 13, 1, 8, 61, 80, 34, 1, 13, 225, 666, 400, 89, 1, 21, 841, 5080, 7300, 2000, 233, 1, 34, 3136, 40106, 118128, 80282, 10000, 610, 1, 55, 11705, 313136, 2008890, 2735828, 883049, 50000, 1597, 1, 89, 43681, 2455013, 33735505, 100047288
Offset: 1
Examples
Some solutions for 5X3 ..1..0..2....0..5..2....0..5..2....0..2..1....0..2..1....4..5..2....1..0..2 ..4..3..5....7..4..1....7..4..1....3..4..5....3..5..4....3..0..1....4..3..5 ..6..7..8....6..3..8...10..3..8....7.11..8....6..8..7....6..8..7...10..7..8 .10..9.11....9.11.10....9..6.11...13..6.10...10..9.11...13.10.11...13..6.11 .12.14.13...12.14.13...12.13.14...12..9.14...12.13.14...12..9.14...12..9.14
Links
- R. H. Hardin, Table of n, a(n) for n = 1..179
Comments