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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A183969 Number of (n+1) X 9 0..2 arrays with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one. 0

%I #8 Apr 13 2023 15:39:54

%S 22235391,6415409881,2080498882227,802997664018905,314952766527081107

%N Number of (n+1) X 9 0..2 arrays with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.

%C Column 8 of A183971.

%e Some solutions for 3 X 9

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

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

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

%e ...

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

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

%Y Cf. A183971.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 08 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 December 10 22:20 EST 2023. Contains 367717 sequences. (Running on oeis4.)