|
|
A206113
|
|
Number of (n+1) X 4 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
|
|
1
|
|
|
6028, 22624, 88596, 520800, 2408480, 10792800, 59892000, 276975200, 1241172000, 6887580000, 31852148000, 142734780000, 792071700000, 3662997020000, 16414499700000, 91088245500000, 421244657300000, 1887667465500000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 115*a(n-3) for n>6.
|
|
EXAMPLE
|
Some solutions for n=4:
..0..1..1..2....3..2..2..3....0..0..1..3....1..0..0..2....3..2..0..2
..1..1..2..0....0..3..2..2....3..0..0..1....3..1..0..0....2..0..0..2
..1..2..0..0....0..0..3..2....2..3..0..0....3..3..1..0....0..0..1..3
..2..0..0..2....2..0..0..3....2..2..3..0....0..3..3..1....0..1..3..3
..0..0..1..3....3..1..0..3....3..2..2..3....1..0..3..3....1..3..3..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|