login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253377 Number of (3+1)X(n+1) 0..2 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw 1

%I

%S 2500,22631,219438,2000385,17316309,128407497,912012350,5602735678,

%T 33436453693,176885943216,917401073689,4314850614208,20011936293206,

%U 85743645410236,363685859775159,1446109155724143,5708063204873431

%N Number of (3+1)X(n+1) 0..2 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw

%C Row 3 of A253375

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

%e Some solutions for n=2

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 30 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 05:51 EDT 2021. Contains 345018 sequences. (Running on oeis4.)