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.

A250418 Number of length n+1 0..7 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 A250418 #6 Jul 23 2025 12:23:19
%S A250418 15,232,927,11906,84094,845358,6847916,60473968,493271080,4110606460,
%T A250418 33227112639,270174922792,2170847791630,17476736034672,
%U A250418 140045328565480,1123079823815258,8990031255733660,71987420633900826,576024775450468215
%N A250418 Number of length n+1 0..7 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.
%C A250418 Column 7 of A250419
%H A250418 R. H. Hardin, <a href="/A250418/b250418.txt">Table of n, a(n) for n = 1..23</a>
%e A250418 Some solutions for n=5
%e A250418 ..0....2....7....2....7....2....7....7....2....3....0....2....2....6....0....2
%e A250418 ..7....4....2....1....0....5....0....6....6....6....5....0....5....5....4....2
%e A250418 ..3....6....4....7....0....4....5....6....2....2....3....0....5....2....0....6
%e A250418 ..6....6....2....1....4....1....1....1....6....2....5....6....3....6....3....0
%e A250418 ..0....2....4....4....0....3....5....2....5....3....4....0....0....7....1....0
%e A250418 ..1....4....0....5....7....2....0....6....3....4....7....3....1....7....2....6
%K A250418 nonn
%O A250418 1,1
%A A250418 _R. H. Hardin_, Nov 22 2014