cp's OEIS Frontend

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

%I A263710 #13 Oct 21 2022 14:32:48
%S A263710 1,2,3,5,8,11,17,25,37,57,84,127,191,284,429,641,961,1445,2161,3246,
%T A263710 4867,7293,10948,16407,24609,36913,55337,83009,124472,186655,279951,
%U A263710 419784,629561,944129,1415809,2123305,3184145,4775114,7161091,10738981,16104880
%N A263710 Number of length n arrays of permutations of 0..n-1 with each element moved by -1 to 1 places and every four consecutive elements having its maximum within 4 of its minimum.
%H A263710 R. H. Hardin, <a href="/A263710/b263710.txt">Table of n, a(n) for n = 1..210</a>
%H A263710 Michael A. Allen, <a href="https://arxiv.org/abs/2210.08167">Combinations without specified separations and restricted-overlap tiling with combs</a>, arXiv:2210.08167 [math.CO], 2022.
%F A263710 Empirical: a(n) = a(n-1) + a(n-3) - a(n-4) + 2*a(n-5) - a(n-6) + a(n-7).
%F A263710 Empirical g.f.: x*(1 - x + x^2)*(1 + 2*x + 2*x^2 + x^3 + x^4) / (1 - x - x^3 + x^4 - 2*x^5 + x^6 - x^7). - _Colin Barker_, Jan 02 2019
%e A263710 Some solutions for n=7:
%e A263710 ..0....0....0....0....1....0....0....1....1....0....1....1....0....0....1....0
%e A263710 ..2....1....2....2....0....1....1....0....0....1....0....0....1....1....0....1
%e A263710 ..1....2....1....1....2....2....2....2....2....3....2....3....2....3....3....3
%e A263710 ..3....3....3....4....3....3....4....4....4....2....3....2....4....2....2....2
%e A263710 ..4....4....5....3....4....4....3....3....3....4....4....4....3....4....4....5
%e A263710 ..5....6....4....5....6....5....5....6....5....5....5....6....6....6....5....4
%e A263710 ..6....5....6....6....5....6....6....5....6....6....6....5....5....5....6....6
%Y A263710 Column 1 of A263714.
%K A263710 nonn
%O A263710 1,2
%A A263710 _R. H. Hardin_, Oct 24 2015