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!)
A183972 Half the number of (n+1)X2 0..3 arrays with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one 1

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

%S 128,992,7688,64976,549152,4780976,41623688,366310352,3223723808,

%T 28480830608,251621342408,2226098835920,19694339040800,

%U 174322195009040,1542993019964552,13660022569173968,120931341993127712

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

%C Column 1 of A183976

%H Ron Hardin, <a href="/A183972/b183972.txt">Table of n, a(n) for n = 1..200</a>

%F Empirical: a(n)=10*a(n-1)-96*a(n-3)+669*a(n-4)-6162*a(n-5)+3936*a(n-6)+20976*a(n-7)-24228*a(n-8)+291240*a(n-9)-94464*a(n-10)-1024704*a(n-11)+385344*a(n-12)-24192*a(n-13)+912384*a(n-15)-331776*a(n-16)

%e Some solutions for 3X2

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

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

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

%e ...

%e ...4.......2.......4.......9.......6.......8.......6.......9.......4.......7...

%e ...5.......3.......4......10.......7.......8.......6.......8.......4.......6...

%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 19 10:31 EDT 2024. Contains 371791 sequences. (Running on oeis4.)