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!)
A237789 Number of (n+1)X(4+1) 0..3 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I #4 Feb 13 2014 06:44:29

%S 108626,5195344,256311790,12795841200,635807130472,31548627779530,

%T 1566949786889880,77875021827170574,3868675262695142732,

%U 192157134168657424490,9545741883703330772072,474231874889121097925970

%N Number of (n+1)X(4+1) 0..3 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one

%C Column 4 of A237791

%H R. H. Hardin, <a href="/A237789/b237789.txt">Table of n, a(n) for n = 1..79</a>

%e Some solutions for n=1

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

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

%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 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)