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 Dec 11 2014 12:15:24
%S 35,265,1191,6293,34186,180069,928891,4735071,23964561,120719043,
%T 606298270,3039564229,15221943388,76182073997,381128397860,
%U 1906301852251,9533515639290,47673711673865,238387418606844,1191995420401203
%N Number of length n+2 0..4 arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero
%C Column 4 of A251935
%H R. H. Hardin, <a href="/A251931/b251931.txt">Table of n, a(n) for n = 1..118</a>
%e Some solutions for n=6
%e ..1....0....1....0....0....1....1....2....2....0....2....2....2....2....1....2
%e ..0....3....2....3....0....1....4....3....2....2....0....2....2....0....2....1
%e ..1....4....0....2....3....2....3....1....1....1....4....3....0....4....4....2
%e ..2....1....0....2....4....2....4....2....0....2....3....3....3....3....4....1
%e ..3....1....1....3....2....3....2....4....2....4....2....2....4....4....0....1
%e ..2....0....1....2....3....2....3....1....3....1....4....4....1....4....0....4
%e ..0....2....3....0....4....3....1....0....4....1....0....2....2....3....3....0
%e ..2....0....0....1....2....2....1....4....4....1....1....2....0....2....2....0
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 11 2014