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.

A250415 Number of length n+1 0..4 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 A250415 #6 Jul 23 2025 12:22:56
%S A250415 9,65,205,1351,5982,34415,169352,904695,4547008,23448029,117953499,
%T A250415 598260521,3002881031,15113176921,75724031785,379750748041,
%U A250415 1900758538693,9516621521809,47607635835257,238183334181909,1191212059701364
%N A250415 Number of length n+1 0..4 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.
%C A250415 Column 4 of A250419
%H A250415 R. H. Hardin, <a href="/A250415/b250415.txt">Table of n, a(n) for n = 1..91</a>
%e A250415 Some solutions for n=6
%e A250415 ..0....1....1....2....1....4....0....4....3....3....4....3....0....0....1....3
%e A250415 ..4....2....2....2....1....3....1....0....2....0....4....0....4....1....1....2
%e A250415 ..4....4....2....1....3....3....2....4....2....0....4....2....0....2....3....1
%e A250415 ..2....0....1....2....1....1....3....4....3....1....1....1....2....3....1....0
%e A250415 ..3....0....0....2....4....4....3....4....2....4....2....4....0....1....1....0
%e A250415 ..3....4....0....2....1....4....2....0....3....4....1....3....4....1....3....3
%e A250415 ..1....3....1....4....1....0....4....3....2....3....3....4....0....3....1....3
%K A250415 nonn
%O A250415 1,1
%A A250415 _R. H. Hardin_, Nov 22 2014