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!)
A184229 Half the number of (n+1)X8 0..3 arrays with every 2X2 subblock diagonal sum differing from its antidiagonal sum by more than 3 1

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

%S 23355,3302001,231988508,22718557269,1922921988456,174220807520698,

%T 15315046904131217,1365148390837029545,120929646236147243376,

%U 10742955468995988996920,953140018069343327537272

%N Half the number of (n+1)X8 0..3 arrays with every 2X2 subblock diagonal sum differing from its antidiagonal sum by more than 3

%C Column 7 of A184231

%H R. H. Hardin, <a href="/A184229/b184229.txt">Table of n, a(n) for n = 1..200</a>

%e Some solutions for 3X8

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 10 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 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)