|
|
A206090
|
|
Number of (n+1) X 5 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
|
|
1
|
|
|
3564, 5952, 13344, 48816, 131904, 444480, 1645920, 4484736, 15112320, 55961280, 152481024, 513818880, 1902683520, 5184354816, 17469841920, 64691239680, 176268063744, 593974625280, 2199502149120, 5993114167296, 20195137259520
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 34*a(n-3) for n>7.
|
|
EXAMPLE
|
Some solutions for n=4:
..0..2..1..2..0....1..2..2..1..0....2..2..0..0..1....1..2..2..0..1
..2..1..1..2..2....0..1..2..2..1....1..1..2..0..0....2..0..2..2..0
..1..1..2..0..0....0..0..1..2..2....0..1..1..2..0....2..2..0..2..2
..1..2..0..0..2....2..0..0..1..2....1..2..1..1..2....1..2..2..1..2
..2..0..0..1..0....0..1..0..0..1....1..1..2..1..2....2..1..2..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|