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.

A252182 Number of length 6+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 A252182 #5 Jul 23 2025 13:37:53
%S A252182 144,3217,31420,179225,753200,2485637,6994984,17238485,38567844,
%T A252182 79379977,153192080,279354541,486577640,813444257,1314320376,
%U A252182 2058759561,3140840692,4677272217,6820355484,9754298757,13714118196
%N A252182 Number of length 6+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 A252182 Row 6 of A252177
%e A252182 Some solutions for n=4
%e A252182 ..1....0....4....0....4....3....0....2....2....0....4....3....1....1....1....3
%e A252182 ..2....1....1....2....0....2....1....2....0....2....0....2....1....0....2....1
%e A252182 ..0....0....3....2....2....0....0....1....0....0....3....4....3....1....0....2
%e A252182 ..2....1....2....3....3....0....1....0....4....1....1....2....0....4....4....4
%e A252182 ..1....1....1....0....0....0....3....3....1....2....3....1....4....4....0....0
%e A252182 ..1....1....2....4....3....1....1....2....2....2....4....2....0....3....3....2
%e A252182 ..1....3....4....2....0....1....0....4....3....0....3....3....0....4....0....3
%e A252182 ..2....4....1....2....4....2....2....1....3....3....3....4....1....0....2....1
%K A252182 nonn
%O A252182 1,1
%A A252182 _R. H. Hardin_, Dec 15 2014