|
%I #6 Nov 10 2015 11:27:01
%S 2,9,45,144,512,1936,7381,27225,101250,378225,1413721,5271616,
%T 19668992,73410624,274002345,1022528529,3816059522,14241796921,
%U 53151529861,198363344400,740301120000,2762842352400,10311073884541,38481439562281
%N Number of (1+1)X(n+1) arrays of permutations of 0..n*2+1 with each element having index change +-(.,.) 0,0 0,2 or 1,1.
%C Row 1 of A264110.
%H R. H. Hardin, <a href="/A264111/b264111.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 4*a(n-1) -a(n-2) +15*a(n-4) -60*a(n-5) +15*a(n-6) -15*a(n-8) +60*a(n-9) -15*a(n-10) +a(n-12) -4*a(n-13) +a(n-14)
%e Some solutions for n=4
%e ..2..3..8..1..4....6..7..2..3..4....0..7..2..3..4....0..1..2..3..4
%e ..5..0..9..6..7....5..0..1..8..9....5..6..1..8..9....5..8..7..6..9
%Y Cf. A264110.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 03 2015
|
