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

%I #4 Feb 11 2014 09:43:03

%S 63000,1346420,30618976,796647426,20221334140,498113608930,

%T 12343384024320,311516250091564,7827815524635584,195109685747765892,

%U 4870240306854393988,122133722554552201048,3060221955313330464924

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

%C Column 4 of A237677

%H R. H. Hardin, <a href="/A237675/b237675.txt">Table of n, a(n) for n = 1..64</a>

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 11 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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)