A189248 Number of nX3 array permutations with each element making zero or one king moves.
3, 152, 2961, 76629, 1818336, 44308389, 1070959431, 25950094568, 628311228261, 15216392096673, 368483172355520, 8923455937553017, 216095445904425947, 5233099961163002488, 126727881793625193513, 3068918844981224041565
Offset: 1
Keywords
Examples
Some solutions for 4X3 ..3..5..1....1..2..4....3..0..2....1..3..5....4..2..1....1..4..5....1..0..5 ..0..7..2....3..0..7....1..7..4....6..0..2....0..7..8....7..0..2....3..8..2 ..6..4.10....6..5.11....6..5.11....9.11..4....3..6..5....3..9.11....9.11..4 ..9..8.11....9.10..8....9.10..8....7..8.10...10..9.11...10..6..8....6..7.10
Links
- R. H. Hardin, Table of n, a(n) for n = 1..200
Formula
Empirical: a(n) = 20*a(n-1) +125*a(n-2) -566*a(n-3) +249*a(n-4) +916*a(n-5) -1703*a(n-6) +256*a(n-7) +691*a(n-8) -30*a(n-9) -9*a(n-10)
Comments