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!)
A237954 Number of (n+1)X(3+1) 0..3 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 16 2014 06:18:31

%S 6400,45504,336260,2763512,22791116,192579544,1628588344,13907568992,

%T 118686056384,1014383089296,8666752446464,74223588254576,

%U 635247043714680,5434110536483904,46470793076802132,398095616127903432

%N Number of (n+1)X(3+1) 0..3 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 3 of A237956

%H R. H. Hardin, <a href="/A237954/b237954.txt">Table of n, a(n) for n = 1..111</a>

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 16 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 July 16 17:03 EDT 2024. Contains 374358 sequences. (Running on oeis4.)