cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A251427 Number of length n+2 0..7 arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.

This page as a plain text file.
%I A251427 #5 Jul 23 2025 13:20:13
%S A251427 80,1128,9120,94452,863840,7658288,64105154,526064608,4251906158,
%T A251427 34199112972,274205462432,2196305116240,17580163235182,140685755592632
%N A251427 Number of length n+2 0..7 arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.
%C A251427 Column 7 of A251428
%e A251427 Some solutions for n=4
%e A251427 ..0....1....0....3....7....4....0....2....7....7....1....7....3....5....0....3
%e A251427 ..4....3....6....2....4....6....3....3....5....4....2....4....5....2....0....2
%e A251427 ..7....2....5....6....7....0....3....3....3....2....0....5....3....7....1....1
%e A251427 ..1....3....0....1....2....0....1....6....4....1....1....1....2....5....2....3
%e A251427 ..6....0....5....7....3....1....6....4....5....2....6....6....3....2....4....6
%e A251427 ..1....4....5....0....2....5....7....1....6....1....7....7....4....7....3....1
%K A251427 nonn
%O A251427 1,1
%A A251427 _R. H. Hardin_, Dec 02 2014