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.

A250738 Number of (n+1) X (4+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction.

This page as a plain text file.
%I A250738 #8 Nov 17 2018 13:10:35
%S A250738 34,38,46,62,94,158,286,542,1054,2078,4126,8222,16414,32798,65566,
%T A250738 131102,262174,524318,1048606,2097182,4194334,8388638,16777246,
%U A250738 33554462,67108894,134217758,268435486,536870942,1073741854,2147483678,4294967326
%N A250738 Number of (n+1) X (4+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction.
%H A250738 R. H. Hardin, <a href="/A250738/b250738.txt">Table of n, a(n) for n = 1..210</a>
%F A250738 Empirical: a(n) = 3*a(n-1) - 2*a(n-2); a(n) = 2^(n+1) + 30.
%F A250738 Empirical g.f.: 2*x*(17 - 32*x) /  ((1 - x)*(1 - 2*x)). - _Colin Barker_, Nov 17 2018
%e A250738 Some solutions for n=4:
%e A250738 ..0..0..0..0..0....0..0..0..0..1....1..1..1..1..1....1..1..0..0..0
%e A250738 ..1..1..1..1..1....0..0..0..0..1....0..0..0..0..0....1..1..0..0..0
%e A250738 ..1..1..1..1..1....0..0..0..0..1....1..1..1..1..1....1..1..0..0..0
%e A250738 ..1..1..1..1..1....0..0..0..0..1....0..0..0..0..0....1..1..0..0..0
%e A250738 ..0..0..0..0..0....0..0..0..0..1....1..1..1..1..1....1..1..0..0..0
%Y A250738 Column 4 of A250742.
%K A250738 nonn
%O A250738 1,1
%A A250738 _R. H. Hardin_, Nov 27 2014