|
%I #6 Nov 10 2015 11:33:10
%S 25,305,3721,40626,443556,4861800,53290000,586058600,6445199524,
%T 70892939818,779775536401,8576942789777,94339901914129,
%U 1037668357033074,11413575775898244,125540825889208392,1380855507020471056
%N Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 1,0 or 1,2.
%C Row 3 of A264272.
%H R. H. Hardin, <a href="/A264274/b264274.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 11*a(n-1) +10*a(n-2) -110*a(n-3) -111*a(n-4) +1210*a(n-5) +1341*a(n-6) -14630*a(n-7) -111*a(n-8) -110*a(n-9) +1451*a(n-10) -1451*a(n-12) +110*a(n-13) +111*a(n-14) +14630*a(n-15) -1341*a(n-16) -1210*a(n-17) +111*a(n-18) +110*a(n-19) -10*a(n-20) -11*a(n-21) +a(n-22)
%e Some solutions for n=4
%e ..0..1..9..8..4....0..1..9..8..4....5..1..9..3..4....5..8..9..3..4
%e .10.13..7..3..2...10..6.14..3..2....0..6..2.13.14...12.11..0..1..2
%e .17.11..5..6.14....5.11.17.13..7...10.16.19..8..7...15..6..7.18.19
%e .15.16.12.18.19...15.16.12.18.19...15.11.17.18.12...10.16.17.13.14
%Y Cf. A264272.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 10 2015
| 