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!)
A235503 Number of (n+1)X(2+1) 0..3 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise 1

%I

%S 2982,108648,3945383,123132965,3714091695,103423011021,2793351835442,

%T 72239093710651,1829055476890911,45202879299137156,

%U 1102383964087038967,26524099399460940827,633214304285732248830,15005899959785143753881

%N Number of (n+1)X(2+1) 0..3 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise

%C Column 2 of A235506

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

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 11 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 February 26 02:42 EST 2021. Contains 341619 sequences. (Running on oeis4.)