A189254 T(n,k)=Number of nXk array permutations with each element making zero or one king moves.
1, 2, 2, 3, 24, 3, 5, 152, 152, 5, 8, 1168, 2961, 1168, 8, 13, 8448, 76629, 76629, 8448, 13, 21, 62272, 1818336, 7396009, 1818336, 62272, 21, 34, 456320, 44308389, 637586496, 637586496, 44308389, 456320, 34, 55, 3350016, 1070959431, 56892084785
Offset: 1
Examples
Some solutions for 5X3 ..0..3..4....0..3..2....0..3..1....0..3..1....0..3..2....0..3..2....0..3..1 ..6..1..2....1..8..5....7..5..2....7..2..4....1..4..5....4..7..1....6..2..5 ..9..5.10....6..4.10...10..4..8....9..5..8....6.11..7....6..8..5....7..4.11 ..7.11..8...12..7.11....6..9.11....6.12.11....9..8.14...13.14.10....9..8.14 .12.13.14...13..9.14...12.13.14...13.10.14...10.12.13....9.12.11...12.13.10
Links
- R. H. Hardin, Table of n, a(n) for n = 1..144
Crossrefs
Column 1 is A000045(n+1)
Comments