A189435 T(n,k)=Number of nXk array permutations with each element not moving, or moving one space N, SW or SE.
1, 1, 1, 1, 2, 1, 1, 3, 5, 1, 1, 5, 9, 9, 1, 1, 8, 29, 31, 20, 1, 1, 13, 65, 140, 109, 41, 1, 1, 21, 181, 571, 841, 367, 85, 1, 1, 34, 441, 2413, 5680, 4653, 1245, 178, 1, 1, 55, 1165, 10069, 40065, 52241, 26589, 4247, 369, 1, 1, 89, 2929, 42205, 278105, 606201, 493941
Offset: 1
Examples
Some solutions for 5X3 ..0..4..5....0..4..5....3..1..2....0..1..5....0..4..5....0..4..5....0..4..5 ..1..2..8....3..2..1....6..0..5....6..2..8....6..2..1....1..2..8....6..2..1 ..9..3.11....6.10..8....4..7..8....4..3.11....9..3.11....6..3.11....9..3..8 ..7..6.14....9.13..7....9.13.14....7.13.14....7..8.14....7.13.14....7.13.14 .12.13.10...12.11.14...12.11.10...12..9.10...12.13.10...12..9.10...12.11.10
Links
- R. H. Hardin, Table of n, a(n) for n = 1..180
Comments