Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Oct 26 2015 06:38:14
%S 0,0,0,1,5,66,392,4859,26994,232208,1161998,8246455,41787717,
%T 274395962,1457963344,9504972075,53127306403,343749866061,
%U 1960779086021,12451275397390,71531553827855,445155989823862,2568693912325240
%N Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and exactly two more elements moved upwards than downwards
%C Column 7 of A263787
%H R. H. Hardin, <a href="/A263786/b263786.txt">Table of n, a(n) for n = 1..45</a>
%e Some solutions for n=7
%e ..6....6....0....4....6....6....5....3....2....6....5....0....6....4....5....6
%e ..0....1....6....0....4....5....6....0....0....5....4....5....1....0....0....1
%e ..5....2....1....5....1....1....2....6....6....2....1....1....5....1....6....4
%e ..2....0....5....2....2....2....0....1....1....0....2....2....0....6....1....2
%e ..4....3....2....1....3....4....3....4....3....3....0....4....3....3....4....0
%e ..1....5....3....3....5....3....1....2....5....1....3....3....2....5....3....3
%e ..3....4....4....6....0....0....4....5....4....4....6....6....4....2....2....5
%Y Cf. A263787
%K nonn
%O 1,5
%A _R. H. Hardin_, Oct 26 2015