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.

A250796 Number of (n+1)X(7+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.

This page as a plain text file.
%I A250796 #6 Jul 23 2025 12:46:03
%S A250796 1102,3868,13598,48600,177142,653880,2437366,9144752,34478398,
%T A250796 130446176,494830430,1880740552,7158985446,27281746344,104059447110,
%U A250796 397187462784,1516879760334,5795614884304,22151486206382,84689884626136
%N A250796 Number of (n+1)X(7+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.
%C A250796 Column 7 of A250797
%H A250796 R. H. Hardin, <a href="/A250796/b250796.txt">Table of n, a(n) for n = 1..210</a>
%F A250796 Empirical: a(n) = 14*a(n-1) -68*a(n-2) +88*a(n-3) +312*a(n-4) -1008*a(n-5) +62*a(n-6) +2576*a(n-7) -1535*a(n-8) -2790*a(n-9) +1886*a(n-10) +1456*a(n-11) -656*a(n-12) -336*a(n-13)
%e A250796 Some solutions for n=4
%e A250796 ..0..1..0..0..1..1..0..1....1..0..0..0..0..0..0..0....1..0..0..1..0..1..0..1
%e A250796 ..0..1..0..0..1..1..0..0....1..0..0..0..0..0..0..0....1..0..0..1..0..1..0..1
%e A250796 ..0..1..0..0..1..1..1..1....1..0..0..0..0..0..0..0....1..0..0..1..0..1..0..0
%e A250796 ..0..1..0..0..1..1..1..1....1..0..0..0..0..0..0..1....1..0..0..1..0..1..0..1
%e A250796 ..0..1..0..0..1..1..1..1....1..0..0..0..0..0..1..0....1..0..0..0..1..0..1..0
%K A250796 nonn
%O A250796 1,1
%A A250796 _R. H. Hardin_, Nov 27 2014