login
The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237790 Number of (n+1) X (5+1) 0..3 arrays with the maximum plus the minimum minus the lower median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one. 1
822482, 73170922, 6776019974, 635807130472, 59455687424144, 5533969952787576, 517136396051688704, 48239987813844932200, 4509282784420017478722, 420301943749603893452032, 39286597811953910117456968 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 5 of A237791.

LINKS

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

EXAMPLE

Some solutions for n=1

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

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

CROSSREFS

Cf. A237791.

Sequence in context: A344240 A238522 A210060 * A247058 A057069 A016927

Adjacent sequences: A237787 A237788 A237789 * A237791 A237792 A237793

KEYWORD

nonn

AUTHOR

R. H. Hardin, Feb 13 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 November 27 06:39 EST 2022. Contains 358362 sequences. (Running on oeis4.)