cp's OEIS Frontend

A263713 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and every four consecutive elements having its maximum within 4 of its minimum.

%I A263713 #9 Jan 02 2019 23:12:39
%S A263713 1,2,6,24,120,72,54,54,72,120,192,308,480,688,1024,1504,2244,3408,
%T A263713 5092,7672,11508,17200,25856,38712,58064,87156,130576,195948,293808,
%U A263713 440500,660832,990752,1485920,2228496,3341556,5011696,7515444,11270424,16902388
%N A263713 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and every four consecutive elements having its maximum within 4 of its minimum.
%H A263713 R. H. Hardin, <a href="/A263713/b263713.txt">Table of n, a(n) for n = 1..210</a>
%F A263713 Empirical: a(n) = a(n-1) +a(n-3) -a(n-4) +2*a(n-5) -a(n-6) +a(n-7) for n>18.
%F A263713 Empirical g.f.: x*(1 + x + 4*x^2 + 17*x^3 + 95*x^4 - 54*x^5 - 39*x^6 - 107*x^7 + 22*x^8 - 156*x^9 + 24*x^10 - 58*x^11 - 2*x^12 - 8*x^13 - 2*x^14 - 28*x^15 - 12*x^16 - 16*x^17) / (1 - x - x^3 + x^4 - 2*x^5 + x^6 - x^7). - _Colin Barker_, Jan 02 2019
%e A263713 Some solutions for n=7:
%e A263713 ..0....0....0....0....0....1....0....0....1....4....0....0....0....0....0....0
%e A263713 ..4....2....3....1....1....0....1....1....0....0....1....4....1....3....1....1
%e A263713 ..1....1....1....2....2....3....4....3....2....1....4....1....3....1....3....2
%e A263713 ..2....3....2....4....4....2....2....2....3....3....2....2....4....4....2....3
%e A263713 ..3....5....4....5....3....4....5....5....4....2....3....5....2....2....4....4
%e A263713 ..5....4....5....6....6....5....3....6....5....5....5....3....5....5....6....5
%e A263713 ..6....6....6....3....5....6....6....4....6....6....6....6....6....6....5....6
%Y A263713 Column 4 of A263714.
%K A263713 nonn
%O A263713 1,2
%A A263713 _R. H. Hardin_, Oct 24 2015