cp's OEIS Frontend

A249701 Number of length n+3 0..2 arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.

%I A249701 #9 Nov 09 2018 14:21:15
%S A249701 39,69,125,221,377,659,1177,2119,3805,6857,12437,22681,41475,76011,
%T A249701 139645,257161,474439,876539,1621387,3002407,5564769,10321599,
%U A249701 19156321,35571383,66081147,122803551,228283091,424467169,789412673,1468380739
%N A249701 Number of length n+3 0..2 arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.
%H A249701 R. H. Hardin, <a href="/A249701/b249701.txt">Table of n, a(n) for n = 1..210</a>
%F A249701 Empirical: a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3) + 2*a(n-4) - 5*a(n-5) + a(n-6) -a(n-7) - 2*a(n-8) + 2*a(n-10).
%F A249701 Empirical g.f.: x*(39 - 48*x + 35*x^2 - 25*x^3 - 127*x^4 - 2*x^5 - 55*x^6 - 36*x^7 + 34*x^8 + 54*x^9) / ((1 + x)*(1 - 2*x + 2*x^2 - 2*x^3)*(1 - 2*x + x^2 - x^3 - x^4 + x^6)). - _Colin Barker_, Nov 09 2018
%e A249701 Some solutions for n=6:
%e A249701 ..0....0....1....2....1....2....1....2....1....1....2....0....1....1....1....1
%e A249701 ..1....1....0....0....2....2....2....1....0....1....1....1....0....0....1....2
%e A249701 ..2....0....1....1....1....2....0....1....2....1....1....2....1....1....1....1
%e A249701 ..1....0....1....1....0....2....1....1....1....1....1....1....1....2....1....1
%e A249701 ..0....0....1....2....1....0....1....1....1....0....2....0....1....1....1....0
%e A249701 ..1....0....1....1....1....2....1....1....1....1....0....1....0....1....1....1
%e A249701 ..1....0....1....1....1....2....1....2....1....1....1....1....1....1....1....1
%e A249701 ..2....0....1....0....1....2....2....0....0....1....1....2....1....1....0....1
%e A249701 ..0....1....0....1....0....2....1....1....2....1....2....1....2....0....1....0
%Y A249701 Column 2 of A249707.
%K A249701 nonn
%O A249701 1,1
%A A249701 _R. H. Hardin_, Nov 04 2014