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.

A250740 Number of (n+1) X (6+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 A250740 #8 Nov 17 2018 13:11:14
%S A250740 130,134,142,158,190,254,382,638,1150,2174,4222,8318,16510,32894,
%T A250740 65662,131198,262270,524414,1048702,2097278,4194430,8388734,16777342,
%U A250740 33554558,67108990,134217854,268435582,536871038,1073741950,2147483774,4294967422
%N A250740 Number of (n+1) X (6+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 A250740 R. H. Hardin, <a href="/A250740/b250740.txt">Table of n, a(n) for n = 1..210</a>
%F A250740 Empirical: a(n) = 3*a(n-1) - 2*a(n-2); a(n) = 2^(n+1) + 126.
%F A250740 Empirical g.f.: 2*x*(65 - 128*x) / ((1 - x)*(1 - 2*x)). - _Colin Barker_, Nov 17 2018
%e A250740 Some solutions for n=4:
%e A250740 ..0..0..0..0..0..0..0....0..1..1..1..0..0..0....0..1..1..0..0..0..1
%e A250740 ..0..0..0..0..0..0..0....0..1..1..1..0..0..0....0..1..1..0..0..0..1
%e A250740 ..0..0..0..0..0..0..0....0..1..1..1..0..0..0....0..1..1..0..0..0..1
%e A250740 ..1..1..1..1..1..1..1....0..1..1..1..0..0..0....0..1..1..0..0..0..1
%e A250740 ..1..1..1..1..1..1..1....0..1..1..1..0..0..0....0..1..1..0..0..0..1
%Y A250740 Column 6 of A250742.
%K A250740 nonn
%O A250740 1,1
%A A250740 _R. H. Hardin_, Nov 27 2014