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

%I #4 Feb 16 2014 06:09:17

%S 1460,12218,102396,945688,8557942,78337964,716030830,6626058730,

%T 60902085946,559346439326,5140225864226,47419445292180,

%U 436362328110996,4011308753979910,36899808297882686,339945224296109426

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

%C Column 2 of A237951

%H R. H. Hardin, <a href="/A237947/b237947.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=3

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

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

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

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

%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 March 1 12:27 EST 2024. Contains 370433 sequences. (Running on oeis4.)