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.

A250737 Number of (n+1) X (3+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 A250737 #8 Nov 16 2018 17:39:28
%S A250737 18,22,30,46,78,142,270,526,1038,2062,4110,8206,16398,32782,65550,
%T A250737 131086,262158,524302,1048590,2097166,4194318,8388622,16777230,
%U A250737 33554446,67108878,134217742,268435470,536870926,1073741838,2147483662,4294967310
%N A250737 Number of (n+1) X (3+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 A250737 R. H. Hardin, <a href="/A250737/b250737.txt">Table of n, a(n) for n = 1..210</a>
%F A250737 Empirical: a(n) = 3*a(n-1) - 2*a(n-2); a(n) = 2^(n+1) + 14.
%F A250737 Empirical g.f.: 2*x*(9 - 16*x) / ((1 - x)*(1 - 2*x)). - _Colin Barker_, Nov 16 2018
%e A250737 Some solutions for n=4:
%e A250737 ..0..1..0..0....1..0..1..1....0..0..0..0....0..0..1..1....0..0..0..0
%e A250737 ..0..1..0..0....1..0..1..1....1..1..1..1....0..0..1..1....0..0..0..0
%e A250737 ..0..1..0..0....1..0..1..1....1..1..1..1....0..0..1..1....0..0..0..0
%e A250737 ..0..1..0..0....1..0..1..1....0..0..0..0....0..0..1..1....0..0..0..0
%e A250737 ..0..1..0..0....1..0..1..1....1..1..1..1....0..0..1..1....0..0..0..0
%Y A250737 Column 3 of A250742.
%K A250737 nonn
%O A250737 1,1
%A A250737 _R. H. Hardin_, Nov 27 2014