|
|
A206092
|
|
Number of (n+1) X 7 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
|
|
1
|
|
|
52812, 54432, 86496, 444480, 2156544, 10584000, 56633472, 279244800, 1373929344, 7362351360, 36301824000, 178610814720, 957105676800, 4719237120000, 23219405913600, 124423737984000, 613500825600000, 3018522768768000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 130*a(n-3) for n>9.
|
|
EXAMPLE
|
Some solutions for n=4:
..0..2..1..2..2..1..0....1..1..2..0..0..2..1....0..2..2..0..1..0..1
..0..2..2..0..2..2..1....0..1..1..2..0..0..2....2..2..0..1..1..0..0
..1..0..2..2..0..2..2....2..0..1..1..2..0..0....2..0..1..1..2..1..1
..1..1..0..2..2..1..1....2..2..0..1..1..2..2....0..1..1..2..1..1..2
..0..1..1..0..2..1..2....0..2..2..0..1..2..0....0..1..0..1..1..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|