The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236793 Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal 1

%I

%S 825,6217,47831,420133,3722333,34857701,327044595,3142571647,

%T 30163324455,292580627371,2833735962287,27576788024513,

%U 268062581546783,2611496864226001,25423252467853609,247758144088418341

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

%C Column 3 of A236798

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

%H R. H. Hardin, <a href="/A236793/a236793.txt">Empirical recurrence of order 83</a>

%F Empirical recurrence of order 83 (see link above)

%e Some solutions for n=3

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 31 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 07:28 EST 2021. Contains 349365 sequences. (Running on oeis4.)