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.

A250276 Number of length n+1 0..7 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 A250276 #5 Jul 23 2025 12:16:27
%S A250276 8,88,288,3156,25964,281552,2908232,30143732,301550620,2901853512,
%T A250276 26702134812,235590646376
%N A250276 Number of length n+1 0..7 arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250276 Column 7 of A250277
%e A250276 Some solutions for n=5
%e A250276 ..6....5....7....7....0....3....2....5....0....7....0....1....5....6....6....6
%e A250276 ..4....4....1....0....5....7....3....2....2....3....0....5....2....7....3....4
%e A250276 ..6....1....6....0....3....2....5....2....1....6....6....1....6....7....7....0
%e A250276 ..7....1....6....7....1....4....5....5....1....4....0....3....1....4....3....3
%e A250276 ..4....4....1....6....0....5....3....2....2....3....3....5....5....1....3....2
%e A250276 ..4....5....7....5....4....7....4....5....4....1....6....5....1....2....6....4
%K A250276 nonn
%O A250276 1,1
%A A250276 _R. H. Hardin_, Nov 16 2014