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.

A250282 Number of length 7+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 A250282 #5 Jul 23 2025 12:17:07
%S A250282 128,2763,20252,107387,381812,1154141,2908232,6704631,13816144,
%T A250282 26741121,48197940,83583525,137527528,219303553,336659016,505804957,
%U A250282 737614588,1056435849,1478402044,2041032531,2764805264
%N A250282 Number of length 7+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250282 Row 7 of A250277
%e A250282 Some solutions for n=4
%e A250282 ..0....4....2....2....4....0....3....0....0....2....2....0....1....3....4....1
%e A250282 ..1....2....2....0....0....1....1....3....1....1....4....1....1....1....1....1
%e A250282 ..4....2....1....1....3....3....1....2....4....4....0....4....4....3....3....3
%e A250282 ..2....4....4....4....2....0....3....0....4....2....3....0....4....0....1....2
%e A250282 ..1....1....2....2....1....4....3....4....3....2....2....2....1....4....0....1
%e A250282 ..2....0....1....2....4....1....4....4....1....0....0....2....4....3....0....1
%e A250282 ..4....0....0....3....0....1....1....1....4....2....1....3....4....0....1....2
%e A250282 ..4....0....2....4....0....0....1....0....2....0....2....0....1....1....0....1
%K A250282 nonn
%O A250282 1,1
%A A250282 _R. H. Hardin_, Nov 16 2014