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.

A250424 Number of length 7+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 A250424 #6 Jul 23 2025 12:23:45
%S A250424 136,3069,29221,169352,713260,2399000,6847916,17247435,39349946,
%T A250424 82830804,163171880,303974701,539955055,920393391,1513595984,
%U A250424 2411810686,3737466811,5649538780,8351938843,12101749148,17220184737,24102352508
%N A250424 Number of length 7+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.
%C A250424 Row 7 of A250419
%H A250424 R. H. Hardin, <a href="/A250424/b250424.txt">Table of n, a(n) for n = 1..34</a>
%e A250424 Some solutions for n=4
%e A250424 ..0....3....3....4....2....3....2....1....0....1....3....0....2....1....3....4
%e A250424 ..0....1....1....0....2....1....2....0....0....0....0....1....2....1....1....0
%e A250424 ..3....3....2....2....3....1....1....1....2....2....3....4....0....1....3....2
%e A250424 ..0....2....2....0....0....1....3....4....2....3....1....0....4....4....0....2
%e A250424 ..0....0....0....4....1....0....1....1....2....4....2....1....4....2....1....4
%e A250424 ..2....4....1....4....3....0....4....1....1....4....2....0....1....0....2....2
%e A250424 ..0....3....0....3....4....1....4....3....4....3....0....1....3....4....4....2
%e A250424 ..1....1....1....1....2....4....0....2....2....2....0....1....2....3....1....0
%K A250424 nonn
%O A250424 1,1
%A A250424 _R. H. Hardin_, Nov 22 2014