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

 

Logo

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!)
A184605 Half the number of (n+1)X(n+1) binary arrays with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one 0

%I

%S 8,160,8643,1396000,624608260,771907128421,2659360843218429,

%T 25614152794948938706

%N Half the number of (n+1)X(n+1) binary arrays with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one

%C Diagonal of A184614

%e Some solutions for 4X4

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

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

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

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

%e ...

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

%e ...2..2..3.......4..3..2.......3..2..1.......3..3..3.......3..2..2...

%e ...1..2..2.......3..3..3.......2..1..2.......3..3..3.......4..3..3...

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 18 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 11:11 EST 2022. Contains 358359 sequences. (Running on oeis4.)