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.

A250279 Number of length 4+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 A250279 #6 Jul 23 2025 12:16:47
%S A250279 16,79,240,581,1132,1991,3156,4841,7024,9807,13180,17561,22788,28943,
%T A250279 36012,44421,53964,65179,77596,91809,107508,124907,143800,165353,
%U A250279 188792,214495,242152,272493,305164,341051,379132,420569,464568,511663,561324
%N A250279 Number of length 4+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250279 Row 4 of A250277
%H A250279 R. H. Hardin, <a href="/A250279/b250279.txt">Table of n, a(n) for n = 1..68</a>
%e A250279 Some solutions for n=6
%e A250279 ..0....2....0....3....2....0....5....1....0....2....6....6....0....0....2....4
%e A250279 ..3....4....2....2....5....4....3....6....0....4....2....5....2....3....1....1
%e A250279 ..1....1....4....5....3....0....5....1....0....3....0....4....4....5....3....3
%e A250279 ..4....2....3....2....1....0....4....2....2....4....6....2....3....6....2....2
%e A250279 ..6....0....6....3....4....0....3....1....0....2....2....4....2....4....4....0
%K A250279 nonn
%O A250279 1,1
%A A250279 _R. H. Hardin_, Nov 16 2014