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.

A250767 Number of (n+1) X (6+1) 0..1 arrays with nondecreasing 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 A250767 #8 Nov 18 2018 12:23:25
%S A250767 262,410,622,962,1558,2666,4798,8978,17254,33722,66574,132194,263350,
%T A250767 525578,1049950,2098610,4195846,8390234,16778926,33556226,67110742,
%U A250767 134219690,268437502,536873042,1073744038,2147485946,4294969678
%N A250767 Number of (n+1) X (6+1) 0..1 arrays with nondecreasing 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.
%H A250767 R. H. Hardin, <a href="/A250767/b250767.txt">Table of n, a(n) for n = 1..210</a>
%F A250767 Empirical: a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3); a(n) = 64*2^(n-1) + 84*n + 114.
%F A250767 Empirical g.f.: 2*x*(131 - 319*x + 146*x^2) / ((1 - x)^2*(1 - 2*x)). - _Colin Barker_, Nov 18 2018
%e A250767 Some solutions for n=4:
%e A250767 ..1..0..1..1..1..0..0....0..0..1..1..1..0..1....0..1..1..1..0..0..0
%e A250767 ..1..0..1..1..1..0..0....0..0..1..1..1..0..1....0..1..1..1..0..0..0
%e A250767 ..1..0..1..1..1..0..0....0..0..1..1..1..0..1....0..1..1..1..0..0..1
%e A250767 ..1..0..1..1..1..0..0....0..0..1..1..1..0..1....0..1..1..1..0..0..1
%e A250767 ..1..0..1..1..1..0..0....0..0..1..1..1..0..1....0..1..1..1..0..0..1
%Y A250767 Column 6 of A250769.
%K A250767 nonn
%O A250767 1,1
%A A250767 _R. H. Hardin_, Nov 27 2014