%I #6 Nov 10 2015 11:21:20
%S 441,52941,6355441,563080476,49887902736,4553473226652,
%T 415614152704689,37837169158128324,3444664626033715984,
%U 313643056202480964516,28557777718204425120609,2600217761364081231601512
%N Number of (n+1)X(6+1) arrays of permutations of 0..n*7+6 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.
%C Column 6 of A264090.
%H R. H. Hardin, <a href="/A264088/b264088.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 87*a(n-1) +32068*a(n-3) +180766*a(n-4) -3715198*a(n-5) -16639004*a(n-6) +149707392*a(n-7) +542256817*a(n-8) +224301365*a(n-9) +4280490864*a(n-10) -2613943512*a(n-11) +12541107972*a(n-12) -12056948868*a(n-13) +9621158616*a(n-14) -5946708960*a(n-15) -2779571151*a(n-16) +6286349025*a(n-17) -2468635920*a(n-18) -364811148*a(n-19) +148489470*a(n-20) -3874014*a(n-21) +2657124*a(n-22) +16767*a(n-24) +243*a(n-25) for n>27
%e Some solutions for n=2
%e ..1..0..2..3..4..6..5....1..0..3..2..5..4.18....1..0..2.15..4..6..5
%e ..7..9..8.10.12.11.13....7..8.10..9.12.11.13....7..9..8.10.11.13.12
%e .14.15.17.16.18.19.20...14.16.15.17..6.19.20...14..3.16.18.17.20.19
%Y Cf. A264090.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 03 2015
|