|
%I #4 Nov 15 2015 18:39:40
%S 2,2,14,38,137,432,1417,4554,14710,47394,152762,492284,1586369,
%T 5112128,16473473,53085636,171065674,551254626,1776394534,5724372546,
%U 18446568521,59443412528,191554172489,617276369198,1989150291038,6409964077506
%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 0,-1 0,1 or 1,0.
%C Row 2 of A264506.
%H R. H. Hardin, <a href="/A264508/b264508.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 2*a(n-1) +7*a(n-2) -8*a(n-3) -9*a(n-4) +10*a(n-5) -a(n-6) +a(n-8) -10*a(n-9) +9*a(n-10) +8*a(n-11) -7*a(n-12) -2*a(n-13) +a(n-14)
%e Some solutions for n=4
%e ..1..0..3..4..8....1..2..3..7..8....1..2..6..4..3....1..2..6..4..3
%e ..6.10..2..7.13....0.10.11.12..4....0..7.11.12..8....0..7..8.12.13
%e ..5.12.11.14..9....5..6.13.14..9....5.10.13.14..9....5.10.11.14..9
%Y Cf. A264506.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 15 2015
|
