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.

A251432 Number of length 5+2 0..n 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 A251432 #6 Jul 23 2025 13:20:41
%S A251432 56,1003,7458,34893,122452,349257,863840,1913597,3880178,7339389,
%T A251432 13094686,22262367,36301476,57177921,87246716,129715887,188194300,
%U A251432 267455817,372765018,511177141,689729654,918345073,1206588778,1567668037
%N A251432 Number of length 5+2 0..n 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 A251432 Row 5 of A251428
%H A251432 R. H. Hardin, <a href="/A251432/b251432.txt">Table of n, a(n) for n = 1..30</a>
%e A251432 Some solutions for n=5
%e A251432 ..0....4....2....3....1....3....1....3....1....4....3....3....1....2....1....0
%e A251432 ..2....3....1....1....4....0....3....0....2....2....3....3....2....2....2....4
%e A251432 ..1....1....5....2....2....3....1....3....1....3....5....4....3....0....2....1
%e A251432 ..4....3....4....3....2....1....4....4....5....4....1....1....1....0....0....0
%e A251432 ..2....5....1....4....2....3....2....2....4....0....3....3....3....4....5....2
%e A251432 ..3....4....4....0....2....4....4....4....5....1....3....1....0....5....2....5
%e A251432 ..4....5....4....1....3....3....4....5....1....2....3....4....5....0....5....5
%K A251432 nonn
%O A251432 1,1
%A A251432 _R. H. Hardin_, Dec 02 2014