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.

A252173 Number of length n+2 0..4 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 A252173 #6 Jul 23 2025 13:37:04
%S A252173 5,285,687,6361,30315,179225,907249,4728833,23847033,120644221,
%T A252173 605522767,3038459385,15215512685,76167143089,381063555999,
%U A252173 1906111738921,9532798497759,47671420448717,238379347788679,1191968945583273
%N A252173 Number of length n+2 0..4 arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.
%C A252173 Column 4 of A252177
%H A252173 R. H. Hardin, <a href="/A252173/b252173.txt">Table of n, a(n) for n = 1..84</a>
%e A252173 Some solutions for n=6
%e A252173 ..2....2....0....2....2....4....2....3....1....4....1....1....1....3....3....2
%e A252173 ..0....0....0....2....1....0....2....2....1....0....0....0....1....0....0....2
%e A252173 ..0....1....2....2....1....3....0....4....1....4....4....2....0....1....4....3
%e A252173 ..2....3....4....3....0....4....3....2....2....0....2....3....3....1....0....3
%e A252173 ..4....3....2....1....2....1....1....1....0....3....1....3....1....0....4....1
%e A252173 ..4....4....0....0....0....3....2....4....4....3....1....2....0....4....2....0
%e A252173 ..2....2....2....1....0....4....3....3....1....4....2....0....1....3....0....1
%e A252173 ..0....3....0....0....4....3....4....3....4....2....4....0....1....4....4....4
%K A252173 nonn
%O A252173 1,1
%A A252173 _R. H. Hardin_, Dec 15 2014