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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A236080 Number of (n+1)X(4+1) 0..2 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise 1
26088, 2634205, 271135379, 25485868729, 2353737191047, 204552132539376, 17233100445331692, 1392972211300394038, 109481604802959903906, 8367007441759114619350, 626181631775394560477219 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 4 of A236082

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..142

EXAMPLE

Some solutions for n=1

..2..0..1..2..2....1..1..0..1..1....1..0..2..2..2....2..0..2..2..0

..1..1..2..0..0....0..0..1..0..1....0..2..0..0..0....0..2..2..0..0

CROSSREFS

Sequence in context: A326931 A235195 A235740 * A115494 A236493 A236488

Adjacent sequences:  A236077 A236078 A236079 * A236081 A236082 A236083

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 05:30 EST 2021. Contains 349627 sequences. (Running on oeis4.)