cp's OEIS Frontend

A264075 Number of (6+1) X (n+1) arrays of permutations of 0..n*7+6 with each element having index change +-(.,.) 0,0 1,1 or 1,2.

%I A264075 #9 Mar 26 2025 18:20:29
%S A264075 64,6765,1210000,94000060,10427064769,1084282319384,118020590202856,
%T A264075 12417526726851620,1326024276162241425,141133437011428928000,
%U A264075 15037363809591528083800,1601021055218612828398400,170459414939407294713069200,18148606785812097702853499600
%N A264075 Number of (6+1) X (n+1) arrays of permutations of 0..n*7+6 with each element having index change +-(.,.) 0,0 1,1 or 1,2.
%H A264075 R. H. Hardin, <a href="/A264075/b264075.txt">Table of n, a(n) for n = 1..152</a>
%F A264075 Empirical: a(n) = 119*a(n-1) -1238*a(n-2) -11504*a(n-3) +132848*a(n-4) +180912*a(n-5) -203520*a(n-6) +1542400*a(n-7) +2403200*a(n-8) -768000*a(n-9) +640000*a(n-10) for n > 19.
%e A264075 Some solutions for n=2:
%e A264075 ..0..5..2....0..5..2....0..1..2....0..5..2....4..5..2....0..5..2....0..1..2
%e A264075 ..8..4..1....8..4..1....3..8..5....3..8..1....8..0..1....7..8..1....8..4..5
%e A264075 ..6.11..3...10.11..3...11..7..4...10..7..4....6.11..3...11..3..4...11..7..3
%e A264075 ..9.10..7...14..6..7...13.14..6....9..6.11...14.10..7....9.14..6...13.14..6
%e A264075 .17.13.14...12.13..9...12..9.10...12.17.14...12.17..9...17.13.10...12..9.10
%e A264075 .15.16.12...20.16.17...19.20.17...19.20.13...19.16.13...19.20.12...20.16.17
%e A264075 .18.19.20...18.19.15...18.15.16...18.15.16...18.15.20...18.15.16...18.19.15
%Y A264075 Row 6 of A264071.
%K A264075 nonn
%O A264075 1,1
%A A264075 _R. H. Hardin_, Nov 02 2015