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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185572 Number of (n+1)X2 0..3 arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum 1

%I #6 Mar 31 2012 12:36:02

%S 256,3392,44944,598688,7974976,106125920,1412256400,18797516000,

%T 250200040000,3330057490400,44321667132304,589910483825696,

%U 7851563387466304,104502021786889760,1390891472006784400

%N Number of (n+1)X2 0..3 arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum

%C Column 1 of A185575

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

%F Empirical: a(n)=6*a(n-1)+692*a(n-3)+5325*a(n-4)+24966*a(n-5)+137368*a(n-6)+200736*a(n-7)-730404*a(n-8)-4060664*a(n-9)-19780992*a(n-10)-30858624*a(n-11)+110419200*a(n-12)+328084992*a(n-13)-615112704*a(n-15)-429981696*a(n-16)

%e Some solutions for 3X2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 31 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.

Last modified April 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)