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

 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
 2982, 108648, 3945383, 123132965, 3714091695, 103423011021, 2793351835442, 72239093710651, 1829055476890911, 45202879299137156, 1102383964087038967, 26524099399460940827, 633214304285732248830, 15005899959785143753881 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 2 of A235506 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 EXAMPLE Some solutions for n=2 ..3..0..3....3..0..2....1..3..1....1..0..1....0..1..2....0..1..3....0..3..3 ..1..3..3....1..2..3....0..3..0....3..0..3....0..2..3....3..1..1....3..3..2 ..0..2..3....3..1..1....3..3..0....0..0..2....1..2..3....2..3..2....3..1..0 CROSSREFS Sequence in context: A289455 A202775 A235744 * A120373 A186866 A252571 Adjacent sequences:  A235500 A235501 A235502 * A235504 A235505 A235506 KEYWORD nonn AUTHOR R. H. Hardin, Jan 11 2014 STATUS approved

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.

Last modified January 27 11:44 EST 2021. Contains 340465 sequences. (Running on oeis4.)