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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A183974 Half the number of (n+1)X4 0..3 arrays with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one 1

%I #5 Mar 31 2012 12:35:55

%S 7688,180236,4470575,124987628,3536846184,104681141079,3111047359429,

%T 94229825477592,2858043537687204,87400399190756306,

%U 2673926034812946620,82100619536962270903,2521153331497012720738,77542693730339312318157

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

%C Column 3 of A183976

%H R. H. Hardin, <a href="/A183974/b183974.txt">Table of n, a(n) for n = 1..51</a>

%e Some solutions for 3X4

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

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

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

%e ...

%e ...6..5..6.......5..4..3.......4..3..4.......6..6..6.......5..5..4...

%e ...6..5..6.......4..3..4.......4..3..4.......6..5..5.......6..6..5...

%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 April 24 05:49 EDT 2024. Contains 371918 sequences. (Running on oeis4.)