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

%I #4 Feb 07 2014 04:57:22

%S 53760,393456,3049632,27053348,234383800,2025855560,17548046424,

%T 155695765032,1358174204976,11752247409536,102066414659576,

%U 907457040604924,7927360821437288,68639199462554376,596728125581641856

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

%C Column 6 of A237375

%H R. H. Hardin, <a href="/A237373/b237373.txt">Table of n, a(n) for n = 1..29</a>

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 07 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 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)