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!)
A236909 Number of (n+1)X(6+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:28:06

%S 417488,18527054,789404948,48719331954,2754669234544,181159580885672,

%T 11117966288886496,735514999641938272,46476544201453674022,

%U 3063085568629398114756,196048500796508353058304

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

%C Column 6 of A236911

%H R. H. Hardin, <a href="/A236909/b236909.txt">Table of n, a(n) for n = 1..41</a>

%e Some solutions for n=1

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

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

%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 April 23 06:45 EDT 2024. Contains 371906 sequences. (Running on oeis4.)