|
|
A189249
|
|
Number of n X 4 array permutations with each element making zero or one king moves.
|
|
1
|
|
|
5, 1168, 76629, 7396009, 637586496, 56892084785, 5025023852501, 445205174822288, 39407984363284853, 3489215319159283593, 308912577758497124608, 27349797876932219710785, 2421416215254898335806661
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 86*a(n-1) +773*a(n-2) -51741*a(n-3) +261147*a(n-4) +1858799*a(n-5) -7576930*a(n-6) -18369505*a(n-7) -63976305*a(n-8) +171881802*a(n-9) +1135450371*a(n-10) -543543057*a(n-11) -2342488484*a(n-12) -2204079757*a(n-13) +2422263217*a(n-14) +6125446560*a(n-15) -2843664887*a(n-16) -3962040267*a(n-17) +2834866226*a(n-18) -976262267*a(n-19) +196899773*a(n-20) +87195350*a(n-21) -15444135*a(n-22) -1459347*a(n-23) -867371*a(n-24) +86035*a(n-25) +10110*a(n-26) -675*a(n-27).
|
|
EXAMPLE
|
Some solutions for 3 X 4
..5..4..7..2....4..1..2..3....5..2..1..3....0..6..7..3....1..4..3..2
..0.10..1..3....0..8..6.10....0..4.10.11....8..1.11..2....8..0.11..6
..8..9..6.11....5..9.11..7....9..8..7..6....9..4..5.10....5..9.10..7
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|