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.

A250280 Number of length 5+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 A250280 #6 Jul 23 2025 12:16:54
%S A250280 32,255,984,2909,6732,14003,25964,45303,73272,113219,167020,241875,
%T A250280 337136,458733,608948,798189,1024476,1301819,1627356,2017585,2469124,
%U A250280 2993697,3591100,4292855,5085744,5985579,6992960,8133607,9394016
%N A250280 Number of length 5+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250280 Row 5 of A250277
%H A250280 R. H. Hardin, <a href="/A250280/b250280.txt">Table of n, a(n) for n = 1..34</a>
%e A250280 Some solutions for n=6
%e A250280 ..2....0....6....4....6....2....4....3....2....0....0....4....6....5....5....1
%e A250280 ..3....3....4....6....0....4....4....0....2....3....3....1....0....6....4....4
%e A250280 ..4....0....3....6....5....4....2....4....3....5....4....3....4....4....1....0
%e A250280 ..3....3....3....3....3....6....3....3....2....3....1....2....4....2....3....5
%e A250280 ..5....0....5....2....0....1....5....6....4....3....2....0....2....1....3....2
%e A250280 ..4....0....4....0....4....6....2....5....2....0....6....0....6....1....5....5
%K A250280 nonn
%O A250280 1,1
%A A250280 _R. H. Hardin_, Nov 16 2014