|
|
A185498
|
|
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
|
|
|
0, 99, 163, 1107, 2887, 13347, 43105, 174081, 613897, 2364597, 8617105, 32495955, 119862859, 448215555, 1661092927, 6192979083, 23001089833, 85659616761, 318444543841, 1185407345757, 4408595984617, 16407725447979, 61033569059827
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
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)
|
|
EXAMPLE
|
Some solutions for 3X2
..0..2....1..1....1..0....0..0....1..0....2..0....1..2....0..1....0..0....0..1
..0..0....1..0....2..1....1..1....2..2....2..1....0..1....0..1....0..0....1..1
..2..0....2..0....2..1....0..0....1..2....0..0....0..1....1..2....1..1....1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|