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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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

%I

%S 81,3205,588459,715994489,3548382361732,83535813974993711,

%T 8373750980551070108806,3763719053101058628172546403,

%U 7388319149846129155540345883224889

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

%C Diagonal of A236902

%H R. H. Hardin, <a href="/A236894/b236894.txt">Table of n, a(n) for n = 1..11</a>

%e Some solutions for n=2

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

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

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 00:03 EST 2021. Contains 340262 sequences. (Running on oeis4.)