cp's OEIS Frontend

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

%I A264069 #9 Mar 26 2025 18:45:00
%S A264069 233,15125,1445345,130697424,11909009849,1084282319384,98725402363225,
%T A264069 8989061417123964,818464496640651553,74522143720797473932,
%U A264069 6785327805998071795553,617811983591878946983992,56252499213505961292639449,5121855437908705959886793744,466350890958042737691769834681
%N A264069 Number of (n+1) X (6+1) arrays of permutations of 0..n*7+6 with each element having index change +-(.,.) 0,0 1,1 or 1,2.
%H A264069 R. H. Hardin, <a href="/A264069/b264069.txt">Table of n, a(n) for n = 1..210</a>
%F A264069 Empirical: a(n) = 87*a(n-1) +374*a(n-2) -470*a(n-3) +207*a(n-4) +3*a(n-5) for n > 7.
%e A264069 Some solutions for n=2:
%e A264069 ..9..1..2..3..4.13..6....0..1..2..3..4..5..6....8..9..2.12.13..5..6
%e A264069 .15..0.17.18.19.20..5....7.16.18.19.11.12.13...15..0.18..1.19..3..4
%e A264069 .14..7.16..8.10.11.12...14.15..8.17..9.10.20...14..7.16.17.10.11.20
%Y A264069 Column 6 of A264071.
%K A264069 nonn
%O A264069 1,1
%A A264069 _R. H. Hardin_, Nov 02 2015