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.

A250273 Number of length n+1 0..4 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 A250273 #6 Jul 23 2025 12:16:06
%S A250273 5,33,89,581,2909,17885,107387,636197,3664311,20397261,110088763,
%T A250273 579849133,3000181901,15332918889,77721061539,391879647949,
%U A250273 1969334263587,9876322139993,49468980310981,247600089386801,1238741942676679
%N A250273 Number of length n+1 0..4 arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.
%C A250273 Column 4 of A250277
%H A250273 R. H. Hardin, <a href="/A250273/b250273.txt">Table of n, a(n) for n = 1..23</a>
%e A250273 Some solutions for n=6
%e A250273 ..0....4....1....0....4....0....3....0....0....2....2....3....3....4....0....4
%e A250273 ..1....2....0....3....3....1....0....1....0....0....4....4....1....3....4....2
%e A250273 ..2....4....4....1....2....0....2....3....3....3....3....0....2....0....1....4
%e A250273 ..4....1....1....0....3....2....3....0....4....3....2....2....3....1....2....1
%e A250273 ..0....3....3....4....3....2....1....3....2....0....4....4....0....1....3....3
%e A250273 ..4....0....3....2....2....3....3....4....4....2....3....1....3....4....4....1
%e A250273 ..2....2....1....2....4....2....1....2....0....2....0....1....1....4....2....0
%K A250273 nonn
%O A250273 1,1
%A A250273 _R. H. Hardin_, Nov 16 2014