|
%I #8 Jan 08 2019 19:00:44
%S 1,2,6,16,40,96,240,608,1536,3840,9600,24064,60416,151552,379904,
%T 952320,2387968,5988352,15015936,37650432,94404608,236716032,
%U 593559552,1488322560,3731881984,9357492224,23463460864,58833502208,147522060288
%N Number of (2+1) X (n+1) arrays of permutations of 0..n*3+2 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.
%H R. H. Hardin, <a href="/A264551/b264551.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 2*a(n-1) + 8*a(n-4).
%F Empirical g.f.: x*(1 + 2*x^2 + 4*x^3) / (1 - 2*x - 8*x^4). - _Colin Barker_, Jan 08 2019
%e Some solutions for n=4:
%e ..1..2..6..4..8....1..5..3..4..8....1..5..3..7..8....1..2..5..4..8
%e ..0.10.11..3.13....0.10..2.12.13....0.10..2.12..4....0..7.10..3.12
%e ..5.12..7.14..9...11..6..7.14..9...11..6.13.14..9...11..6.13.14..9
%Y Row 2 of A264550.
%K nonn
%O 1,2
%A _R. H. Hardin_, Nov 17 2015
|
