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.

A252181 Number of length 5+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.

This page as a plain text file.
%I A252181 #6 Jul 23 2025 13:37:46
%S A252181 56,957,6820,30315,100894,277101,654644,1397115,2729346,5000775,
%T A252181 8646710,14320677,22753218,35050107,52358558,76391397,108844088,
%U A252181 152265601,208998994,282689603,376505412,495411841,643581780,827671511,1052928232
%N A252181 Number of length 5+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.
%C A252181 Row 5 of A252177
%H A252181 R. H. Hardin, <a href="/A252181/b252181.txt">Table of n, a(n) for n = 1..34</a>
%e A252181 Some solutions for n=5
%e A252181 ..1....5....1....5....3....0....4....4....3....0....1....4....0....1....2....2
%e A252181 ..0....4....1....3....1....2....4....2....4....5....2....4....2....0....2....3
%e A252181 ..0....2....1....3....4....1....5....3....2....5....0....3....4....0....5....3
%e A252181 ..4....0....0....5....3....0....3....1....1....4....0....4....5....1....2....5
%e A252181 ..0....1....0....4....5....3....3....1....4....4....3....3....4....5....3....4
%e A252181 ..1....2....4....5....3....4....4....0....4....3....1....5....1....3....2....4
%e A252181 ..3....4....4....4....1....4....2....1....5....5....1....0....5....2....4....4
%K A252181 nonn
%O A252181 1,1
%A A252181 _R. H. Hardin_, Dec 15 2014