|
%I #4 Jan 05 2014 07:16:37
%S 3037,145669,6630699,306034401,14077755879,648127851943,
%T 29833075851519,1373275806129107,63213807371611993,
%U 2909829281017511863,133943834532902027513,6165638117968536944189,283813672199542006647705
%N Number of (n+1)X(3+1) 0..2 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both
%C Column 3 of A235223
%H R. H. Hardin, <a href="/A235218/b235218.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 39*a(n-1) +410*a(n-2) -3737*a(n-3) -13178*a(n-4) +103275*a(n-5) +89722*a(n-6) -961878*a(n-7) -181366*a(n-8) +4083283*a(n-9) -48872*a(n-10) -8784678*a(n-11) +444362*a(n-12) +9715586*a(n-13) -378256*a(n-14) -5306393*a(n-15) +93253*a(n-16) +1319247*a(n-17) +1378*a(n-18) -124156*a(n-19) -3168*a(n-20) +2456*a(n-21)
%e Some solutions for n=2
%e ..1..1..0..0....0..1..0..1....0..2..2..1....0..0..0..1....1..1..0..0
%e ..2..2..0..0....2..2..1..1....1..1..1..1....0..1..1..2....2..1..0..0
%e ..1..2..1..2....1..0..0..1....1..1..1..0....2..1..1..0....2..1..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 05 2014
| 