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.

A250417 Number of length n+1 0..6 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 A250417 #6 Jul 23 2025 12:23:11
%S A250417 13,161,606,6433,39916,341011,2399000,18334295,130350889,947356115,
%T A250417 6693133584,47588393713,334543874696,2356688545513,16526137384381,
%U A250417 115977271626785,812415242570854,5692700008978435,39860063264311589
%N A250417 Number of length n+1 0..6 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.
%C A250417 Column 6 of A250419
%H A250417 R. H. Hardin, <a href="/A250417/b250417.txt">Table of n, a(n) for n = 1..38</a>
%e A250417 Some solutions for n=5
%e A250417 ..1....3....5....5....2....5....1....0....5....1....5....4....5....4....4....4
%e A250417 ..2....1....6....5....6....4....1....4....5....5....6....6....5....3....4....1
%e A250417 ..5....5....2....1....3....6....6....1....5....1....1....6....1....5....3....3
%e A250417 ..6....0....5....6....0....2....6....2....2....0....4....1....3....0....6....3
%e A250417 ..1....2....2....5....4....1....5....5....1....2....4....2....4....6....3....6
%e A250417 ..4....0....1....2....1....5....1....4....1....5....1....5....5....6....1....0
%K A250417 nonn
%O A250417 1,1
%A A250417 _R. H. Hardin_, Nov 22 2014