%I #4 Jan 05 2014 07:20:17
%S 59,427,427,3037,8029,3037,21693,145669,145669,21693,154811,2667851,
%T 6630699,2667851,154811,1105027,48751703,306034401,306034401,48751703,
%U 1105027,7887229,891368897,14077755879,35761397619,14077755879,891368897
%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both
%C Table starts
%C ......59.........427...........3037.............21693................154811
%C .....427........8029.........145669...........2667851..............48751703
%C ....3037......145669........6630699.........306034401...........14077755879
%C ...21693.....2667851......306034401.......35761397619.........4160135051925
%C ..154811....48751703....14077755879.....4160135051925......1222451522196205
%C .1105027...891368897...648127851943...484500703182059....359731584557407665
%C .7887229.16295474229.29833075851519.56410299169343241.105820498283776373809
%H R. H. Hardin, <a href="/A235223/b235223.txt">Table of n, a(n) for n = 1..264</a>
%F Empirical for column k:
%F k=1: a(n) = 6*a(n-1) +9*a(n-2) -6*a(n-3) -2*a(n-4)
%F k=2: [order 8]
%F k=3: [order 21]
%F k=4: [order 59]
%e Some solutions for n=2 k=4
%e ..0..1..2..0..0....0..0..2..0..2....0..2..0..2..2....0..0..1..1..2
%e ..0..1..1..0..1....0..1..2..1..2....0..1..0..1..0....0..1..2..1..2
%e ..0..2..1..2..1....0..2..1..0..1....0..1..0..2..2....0..1..1..0..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 05 2014
|