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!)
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

%I #6 Apr 20 2021 14:49:56

%S 822482,73170922,6776019974,635807130472,59455687424144,

%T 5533969952787576,517136396051688704,48239987813844932200,

%U 4509282784420017478722,420301943749603893452032,39286597811953910117456968

%N 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.

%C Column 5 of A237791.

%H R. H. Hardin, <a href="/A237790/b237790.txt">Table of n, a(n) for n = 1..17</a>

%e Some solutions for n=1

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

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

%Y Cf. A237791.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 13 2014

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 April 25 09:38 EDT 2024. Contains 371967 sequences. (Running on oeis4.)