|
|
A206114
|
|
Number of (n+1) X 5 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
|
|
1
|
|
|
31756, 111552, 520800, 5048352, 21702240, 157206240, 1542266208, 6705992160, 48576728160, 476560258272, 2072151577440, 15010209001440, 147257119806048, 640294837428960, 4638154581444960, 45502450020068832, 197851104765548640
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 309*a(n-3) for n>7.
|
|
EXAMPLE
|
Some solutions for n=4:
..0..1..3..2..3....1..3..3..0..3....0..0..2..1..1....3..1..2..3..3
..1..3..3..2..2....0..1..3..3..1....2..0..0..2..1....3..1..1..2..3
..3..3..2..0..0....0..0..1..3..3....3..2..0..0..3....1..2..1..1..2
..1..1..0..0..1....3..0..0..2..2....3..3..1..0..0....1..1..3..1..1
..2..1..0..1..2....1..2..0..2..3....2..3..3..1..0....2..1..1..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|