The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A236905 Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal 1

%I #4 Feb 01 2014 08:25:37

%S 1056,6762,44836,326868,2411550,18527054,143619570,1138035570,

%T 9082354564,73458657386,597388648952,4899765429646,40348694602260,

%U 334106991780094,2774430383216444,23121941059834148,193077412267829618

%N Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal

%C Column 2 of A236911

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

%e Some solutions for n=3

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 01 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 May 15 14:34 EDT 2024. Contains 372540 sequences. (Running on oeis4.)