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.

A250423 Number of length 6+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.

This page as a plain text file.
%I A250423 #6 Jul 23 2025 12:23:39
%S A250423 72,1061,7504,34415,119364,341011,845358,1878315,3826222,7263401,
%T A250423 13006830,22184249,36304264,57333585,87793296,130863267,190475904,
%U A250423 271446215,379605094,521929211,706693318,943642869,1244141718,1621385877
%N A250423 Number of length 6+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.
%C A250423 Row 6 of A250419
%H A250423 R. H. Hardin, <a href="/A250423/b250423.txt">Table of n, a(n) for n = 1..55</a>
%e A250423 Some solutions for n=5
%e A250423 ..3....1....5....5....2....1....3....1....0....3....1....4....5....1....1....0
%e A250423 ..2....0....3....0....3....0....1....0....2....3....4....0....2....0....5....2
%e A250423 ..1....4....0....5....0....2....5....2....4....2....3....5....4....1....1....0
%e A250423 ..0....1....3....1....2....0....3....4....4....1....2....1....4....2....3....2
%e A250423 ..0....2....4....3....3....2....3....2....5....5....4....4....3....1....3....2
%e A250423 ..1....5....1....2....1....0....5....2....1....4....3....1....3....0....0....5
%e A250423 ..3....2....3....0....5....2....5....5....5....1....4....4....0....4....3....0
%K A250423 nonn
%O A250423 1,1
%A A250423 _R. H. Hardin_, Nov 22 2014