login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A250723 Number of (n+1) X (2+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. 1

%I

%S 22,46,85,144,230,350,513,728,1006,1358,1797,2336,2990,3774,4705,5800,

%T 7078,8558,10261,12208,14422,16926,19745,22904,26430,30350,34693,

%U 39488,44766,50558,56897,63816,71350,79534,88405,98000,108358,119518,131521

%N Number of (n+1) X (2+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.

%H R. H. Hardin, <a href="/A250723/b250723.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 4*a(n-1) - 5*a(n-2) + 5*a(n-4) - 4*a(n-5) + a(n-6).

%F Empirical for n mod 2 = 0: a(n) = (1/24)*n^4 + (1/2)*n^3 + (10/3)*n^2 + 10*n + 8.

%F Empirical for n mod 2 = 1: a(n) = (1/24)*n^4 + (1/2)*n^3 + (10/3)*n^2 + 10*n + (65/8).

%F Empirical g.f.: x*(22 - 42*x + 11*x^2 + 34*x^3 - 31*x^4 + 8*x^5) / ((1 - x)^5*(1 + x)). - _Colin Barker_, Nov 16 2018

%e Some solutions for n=4:

%e ..0..0..0....0..1..1....0..0..1....0..0..0....1..0..1....0..0..0....0..0..0

%e ..0..0..1....1..1..1....0..1..1....0..0..0....0..1..1....0..0..0....0..0..0

%e ..1..0..1....1..1..1....0..1..1....0..0..0....1..1..1....0..0..0....0..0..0

%e ..0..1..1....1..1..1....0..1..1....0..0..0....1..1..1....0..0..0....0..0..1

%e ..0..1..1....1..1..1....1..1..1....0..1..1....1..1..1....1..0..0....0..1..1

%Y Column 2 of A250729.

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 27 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 1 23:35 EDT 2022. Contains 357173 sequences. (Running on oeis4.)