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 #7 Sep 01 2013 18:28:41
%S 7,49,252,1036,3703,12453,42386,151882,567835,2147149,8034340,
%T 29610140,108114007,394245755,1442791435,5301606775,19520651849,
%U 71865418075,264265863322,970764224658,3564641145009,13091320557593,48095042423647
%N Number of arrays of maxima of three adjacent elements of some length n+2 0..6 array.
%C Column 6 of A228461
%H R. H. Hardin, <a href="/A228459/b228459.txt">Table of n, a(n) for n = 1..95</a>
%F Empirical: a(n) = 7*a(n-1) -21*a(n-2) +35*a(n-3) -14*a(n-4) -14*a(n-5) +98*a(n-6) -6*a(n-7) +63*a(n-8) +151*a(n-9) +59*a(n-10) +107*a(n-11) +124*a(n-12) +60*a(n-13) +56*a(n-14) +44*a(n-15) +17*a(n-16) +9*a(n-17) +5*a(n-18) +a(n-19)
%e Some solutions for n=4
%e ..2....6....4....5....4....4....0....2....0....1....6....6....3....6....1....0
%e ..5....3....2....0....0....2....0....3....0....1....0....2....0....3....1....2
%e ..5....4....2....0....1....1....1....6....0....0....2....1....1....0....2....3
%e ..6....4....2....6....3....6....4....6....3....6....3....0....6....3....5....4
%K nonn
%O 1,1
%A _R. H. Hardin_ Aug 22 2013