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.

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

This page as a plain text file.
%I A250281 #5 Jul 23 2025 12:17:01
%S A250281 64,843,4412,17885,51884,130335,281552,564985,1028832,1775463,2887804,
%T A250281 4568929,6917108,10184331,14530168,20394445,27913864,37658171,
%U A250281 49810736,65176853,83924392,106914955,134435648,168004421,207572064
%N A250281 Number of length 6+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250281 Row 6 of A250277
%e A250281 Some solutions for n=6
%e A250281 ..2....5....5....4....4....6....3....6....3....1....6....0....0....5....3....6
%e A250281 ..2....4....3....3....1....3....0....4....3....4....4....0....1....3....0....4
%e A250281 ..5....2....3....3....0....2....3....2....4....6....1....4....6....4....1....2
%e A250281 ..4....3....4....2....0....4....1....3....4....3....1....1....0....5....4....0
%e A250281 ..4....6....2....3....2....0....4....5....3....1....3....3....1....2....2....2
%e A250281 ..1....4....1....2....6....4....6....3....6....3....6....1....4....6....1....1
%e A250281 ..2....3....1....4....4....6....3....2....3....5....6....2....4....5....5....4
%K A250281 nonn
%O A250281 1,1
%A A250281 _R. H. Hardin_, Nov 16 2014