|
%I #5 Mar 31 2012 12:36:16
%S 1,32,263,4277,55440,799069,11047585,155610272,2174615543,30495310793,
%T 427003730560,5982947971505,83805935210153,1174054970088496,
%U 16446690057231391,230398085842470229,3227563109360717136
%N Number of 3Xn array permutations with each element moving zero or one space horizontally, diagonally or antidiagonally
%C Row 3 of A189650
%H R. H. Hardin, <a href="/A189651/b189651.txt">Table of n, a(n) for n = 1..200</a>
%F Empirical: a(n) = 10*a(n-1) +75*a(n-2) -240*a(n-3) -399*a(n-4) +972*a(n-5) -1263*a(n-6) +482*a(n-7) +669*a(n-8) -100*a(n-9) -9*a(n-10)
%e Some solutions for 3X3
%e ..1..5..2....1..0..2....4..0..2....0..2..1....0..2..4....0..1..2....1..0..4
%e ..3..0..4....3..6..5....7..3..1....4..6..5....1..3..5....3..4..5....7..2..5
%e ..7..6..8....4..7..8....6..5..8....7..3..8....7..6..8....7..6..8....6..3..8
%K nonn
%O 1,2
%A _R. H. Hardin_ Apr 24 2011
| 