|
|
A189652
|
|
Number of 4Xn array permutations with each element moving zero or one space horizontally, diagonally or antidiagonally
|
|
1
|
|
|
1, 121, 2161, 107080, 3774889, 157346785, 6156828073, 248034953713, 9875814290816, 395270625350249, 15786227589947721, 631059374453758801, 25216827894687641369, 1007823833701936877224, 40276106049134557246481
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 50*a(n-1) -137*a(n-2) -14254*a(n-3) +150732*a(n-4) +6167*a(n-5) -5222678*a(n-6) +17698431*a(n-7) +3110934*a(n-8) -124198038*a(n-9) +434209880*a(n-10) -578102252*a(n-11) -1022163576*a(n-12) +2063022702*a(n-13) +927202798*a(n-14) -2166125460*a(n-15) +2287055972*a(n-16) -2253433780*a(n-17) -217909454*a(n-18) +358137966*a(n-19) +47291569*a(n-20) +143053130*a(n-21) +25184345*a(n-22) -6278728*a(n-23) -1184530*a(n-24) +75701*a(n-25) +13602*a(n-26) -675*a(n-27)
|
|
EXAMPLE
|
Some solutions for 4X3
..1..0..2....0..1..2....0..2..1....4..3..2....4..0..2....0..5..2....0..2..1
..3..6..5....3..5..4....4..3..5....1..0..5....1..3..5....1..3..4....3..6..5
..4..7..8...10..6..8....7..6..8....6..7..8....6.11..8....7..8.10...10..9..4
..9.10.11....9.11..7....9.10.11....9.10.11...10..9..7....9..6.11....7..8.11
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|