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!)
A236079 Number of (n+1)X(3+1) 0..2 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise 1
3992, 169680, 7147799, 271135379, 10003171144, 349054240169, 11883153992874, 392842405587563, 12777894726279097, 409323490817193034, 12991133927138973427, 409163645547902354020, 12825010207733767198505 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 3 of A236082
LINKS
EXAMPLE
Some solutions for n=2
..0..0..0..1....0..0..0..0....1..1..1..0....1..2..0..0....0..0..1..2
..0..1..0..0....0..2..2..1....0..0..2..2....2..0..2..2....0..0..1..2
..1..0..1..1....0..2..0..2....2..2..2..1....0..0..1..1....0..1..1..0
CROSSREFS
Sequence in context: A235434 A200848 A235739 * A045262 A203088 A061700
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 19 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 2 11:50 EDT 2023. Contains 365833 sequences. (Running on oeis4.)