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!)
A184226 Half the number of (n+1)X5 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 621,14641,224156,4207437,72246797,1292899174,22718557269,

%T 402560143085,7106563915316,125668351802785,2220554387222673,

%U 39250640995900250,693688800303272397,12260638522902016569,216694437717450254826

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

%C Column 4 of A184231

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

%F Empirical: a(n)=17*a(n-1)+108*a(n-2)-1760*a(n-3)-1953*a(n-4)+58066*a(n-5)-35781*a(n-6)-761159*a(n-7)+923230*a(n-8)+4884844*a(n-9)-7337776*a(n-10)-16577262*a(n-11)+28574166*a(n-12)+29948774*a(n-13)-60427857*a(n-14)-27012303*a(n-15)+71527868*a(n-16)+9323166*a(n-17)-48297090*a(n-18)+2120251*a(n-19)+18623886*a(n-20)-2698012*a(n-21)-3945852*a(n-22)+813213*a(n-23)+409293*a(n-24)-99576*a(n-25)-14904*a(n-26)+3888*a(n-27)

%e Some solutions for 3X5

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

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

%e ..1..3..1..3..0....2..3..1..3..2....2..0..3..1..2....3..0..3..0..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 May 12 14:44 EDT 2024. Contains 372481 sequences. (Running on oeis4.)