A189150 T(n,k)=Number of nXk array permutations with each element making zero or one knight moves.
1, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 16, 49, 16, 1, 1, 36, 569, 569, 36, 1, 1, 81, 4372, 22865, 4372, 81, 1, 1, 225, 42689, 602565, 602565, 42689, 225, 1, 1, 625, 412189, 20037184, 46350185, 20037184, 412189, 625, 1, 1, 1600, 3988132, 697391125, 5025299720
Offset: 1
Examples
Some solutions for 5X3 ..5..8..2....0..8..3....5..8..7....7..8..2....0..8..2....7..1..2....5..6..7 ..3..4..0....2..9.10....2..4.10...10..4..5....3.11.10...10.11..0....3..4..0 ..1.12.13....1..7.13....6..0..1...13..0..1...13..7..1....5.14..8....1..2..8 .14.10.11....4..5.11...14..3.12...14..3.12....9..5..4....4..3..6....9.10.12 ..7..6..9...12..6.14...11.13..9...11..6..9...12..6.14...12.13..9...11.13.14
Links
- R. H. Hardin, Table of n, a(n) for n = 1..60
Comments