cp's OEIS Frontend

A264373 Number of (n+1)X(2+1) arrays of permutations of 0..n*3+2 with each element having directed index change 2,-2 -1,0 -1,2 1,0 or 0,-1.

%I A264373 #4 Nov 12 2015 07:55:43
%S A264373 2,1,13,25,128,347,1343,4172,14711,48187,164644,549209,1857120,
%T A264373 6231551,21001218,70602740,237686843,799548823,2690789595,9053237740,
%U A264373 30464275277,102504319825,344916282634,1160576447091,3905173385325,13140236820844
%N A264373 Number of (n+1)X(2+1) arrays of permutations of 0..n*3+2 with each element having directed index change 2,-2 -1,0 -1,2 1,0 or 0,-1.
%C A264373 Column 2 of A264379.
%H A264373 R. H. Hardin, <a href="/A264373/b264373.txt">Table of n, a(n) for n = 1..210</a>
%F A264373 Empirical: a(n) = a(n-1) +13*a(n-2) -4*a(n-3) -57*a(n-4) +11*a(n-5) +138*a(n-6) -25*a(n-7) -213*a(n-8) +38*a(n-9) +220*a(n-10) -26*a(n-11) -151*a(n-12) -7*a(n-13) +62*a(n-14) +19*a(n-15) -21*a(n-16) -8*a(n-17) +7*a(n-18) +a(n-19) -a(n-20)
%e A264373 Some solutions for n=4
%e A264373 ..1..2..3....1..4..3....3..2..5....3..4..5....3..4..5....1..4..3....1..4..3
%e A264373 ..0..7..6....0..7..8....0..1..6....0..1..6....0..1..8....0..7..6....0..5..6
%e A264373 ..9..4..5....2.10..5....7..4..9....2..8..9....2.10..9....2..8..5....2.10..9
%e A264373 .12.13.14....6.13.12...12.13.14...12..7.14....6..7.12...12.13.14...12..7..8
%e A264373 ..8.10.11....9.14.11....8.10.11...13.10.11...13.14.11....9.10.11...13.14.11
%Y A264373 Cf. A264379.
%K A264373 nonn
%O A264373 1,1
%A A264373 _R. H. Hardin_, Nov 12 2015