|
|
A251486
|
|
Number of (n+1)X(3+1) 0..3 arrays with no 2X2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements
|
|
1
|
|
|
50576, 10046784, 1996407424, 396684056960, 78819515764397, 15661071542167376, 3111780313414886566, 618295855606419707392, 122852424799301062666424, 24410188232939001443671104, 4850187451303376251467769813
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 256*a(n-1) -12199*a(n-2) +163792*a(n-3) -450614*a(n-4) -999872*a(n-5) +26782853*a(n-6) -398145776*a(n-7) -1637661603*a(n-8) +5238219360*a(n-9) +12853712360*a(n-10) -27723613504*a(n-11) -38172377104*a(n-12) +34500091392*a(n-13) +70834593600*a(n-14) -41937979392*a(n-15) +11349974016*a(n-16)
|
|
EXAMPLE
|
Some solutions for n=1
..0..2..1..2....2..0..0..0....2..2..3..0....0..0..2..2....2..3..3..3
..1..1..2..3....1..2..2..1....2..0..2..2....1..1..1..0....0..3..1..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|