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

Number of (n+1)X2 0..2 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum
1

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

%S 0,99,163,1107,2887,13347,43105,174081,613897,2364597,8617105,

%T 32495955,119862859,448215555,1661092927,6192979083,23001089833,

%U 85659616761,318444543841,1185407345757,4408595984617,16407725447979,61033569059827

%N Number of (n+1)X2 0..2 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum

%C Column 1 of A185504

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

%F Empirical: a(n)=6*a(n-1)-2*a(n-2)-48*a(n-3)+132*a(n-4)-201*a(n-5)+234*a(n-6)+6*a(n-7)-2052*a(n-8)+5616*a(n-9)-10656*a(n-10)+8640*a(n-11)-5184*a(n-12)

%e Some solutions for 3X2

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

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

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

%K nonn

%O 1,2

%A _R. H. Hardin_ Jan 29 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 11:54 EDT 2024. Contains 376068 sequences. (Running on oeis4.)