|
%I #6 Nov 10 2015 10:20:13
%S 9,99,1089,8679,69169,568343,4669921,38152455,311699025,2548552215,
%T 20837788609,170360646951,1392794147889,11387102116407,93097816935841,
%U 761140735852103,6222865786130449,50876363432350039,415950535502406529
%N Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having index change (+-,+-) 0,0 1,2 or 1,0.
%C Row 2 of A264003.
%H R. H. Hardin, <a href="/A264005/b264005.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 9*a(n-1) -62*a(n-3) +108*a(n-4) -456*a(n-5) -800*a(n-6) +9808*a(n-7) -8032*a(n-8) -256*a(n-9) +12800*a(n-10) -20992*a(n-11) +27648*a(n-12) -24576*a(n-13) +32768*a(n-15) -65536*a(n-16)
%e Some solutions for n=4
%e ..0..1..2..6..4....7..1..5..6..9....0..1..5..6..4....0..6..2..3..9
%e .10.11.14..3.12....0..3..2.13..4...12..3.14.11..2....5.11.12..1..4
%e ..5..8..7.13..9...10.11.12..8.14...10..8..9.13..7...10..8..7.13.14
%Y Cf. A264003.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 31 2015
| 