The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A183576 Half the number of n X n 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors 0

%I

%S 0,14,814,240358,320224986,1988200387149,57140106100076100

%N Half the number of n X n 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors

%C Diagonal of A183584

%e Some solutions with a(1,1)<=1 for 3X3

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

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

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

%K nonn

%O 1,2

%A _R. H. Hardin_ Jan 05 2011

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.

Last modified December 6 06:48 EST 2022. Contains 358595 sequences. (Running on oeis4.)