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!)
A184230 Half the number of (n+1)X9 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 78597,20204829,2366228756,402560143085,58125919236791,

%T 9060575120369248,1365148390837029545,208931377551712553029,

%U 31752580288265710345482,4841142511484050619724845,737035578935913022062779089

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

%C Column 8 of A184231

%H R. H. Hardin, <a href="/A184230/b184230.txt">Table of n, a(n) for n = 1..180</a>

%e Some solutions for 3X9

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

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

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

%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 20 00:58 EDT 2024. Contains 371798 sequences. (Running on oeis4.)