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.

A250171 Number of length 6+1 0..n arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.

This page as a plain text file.
%I A250171 #6 Jul 23 2025 12:15:04
%S A250171 64,1151,7836,37881,129648,380939,938128,2121089,4309040,8284391,
%T A250171 14826764,25544585,41805464,66528651,101887084,152748637,222278752,
%U A250171 318099483,444552268,612989717,829094428,1109083919,1460065140
%N A250171 Number of length 6+1 0..n arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250171 Row 6 of A250167
%H A250171 R. H. Hardin, <a href="/A250171/b250171.txt">Table of n, a(n) for n = 1..32</a>
%e A250171 Some solutions for n=5
%e A250171 ..0....1....0....3....4....3....0....4....1....0....4....0....5....0....4....4
%e A250171 ..1....5....4....4....0....4....0....4....3....1....2....4....0....5....0....0
%e A250171 ..0....3....4....4....4....2....2....1....4....3....5....4....5....3....3....1
%e A250171 ..3....1....2....1....0....2....0....1....2....3....0....3....3....0....3....3
%e A250171 ..5....2....1....1....5....0....1....0....5....3....5....0....0....0....2....2
%e A250171 ..2....3....1....5....2....0....1....0....4....5....1....5....4....3....3....3
%e A250171 ..2....1....0....5....4....5....2....4....1....4....0....0....5....2....4....4
%K A250171 nonn
%O A250171 1,1
%A A250171 _R. H. Hardin_, Nov 13 2014