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.

A252183 Number of length 7+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 A252183 #5 Jul 23 2025 13:38:00
%S A252183 240,9295,123826,907249,4652710,18231947,59838132,169267931,429064420,
%T A252183 989821179,2121738374,4261220223,8118682922,14752915881,25768412560,
%U A252183 43419516045,70948741604
%N A252183 Number of length 7+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 A252183 Row 7 of A252177
%e A252183 Some solutions for n=3
%e A252183 ..2....2....2....3....3....3....1....2....3....0....2....0....2....3....1....3
%e A252183 ..0....3....0....2....0....1....0....2....2....0....3....2....1....0....2....0
%e A252183 ..0....2....2....0....3....2....1....1....2....2....2....3....2....3....2....2
%e A252183 ..0....3....3....1....2....2....2....0....0....2....3....3....2....0....0....3
%e A252183 ..0....2....0....1....0....3....2....0....2....2....3....1....3....2....2....2
%e A252183 ..0....1....0....3....1....1....0....3....2....1....1....2....2....3....0....2
%e A252183 ..2....2....3....3....3....2....2....1....2....1....0....3....2....2....2....2
%e A252183 ..0....0....2....0....1....1....0....0....2....3....0....0....2....1....2....0
%e A252183 ..0....1....2....0....2....1....0....1....1....3....1....3....3....1....3....1
%K A252183 nonn
%O A252183 1,1
%A A252183 _R. H. Hardin_, Dec 15 2014