|
|
A206117
|
|
Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
|
|
1
|
|
|
5538732, 16072760, 59892000, 1542266208, 18371031840, 373319837280, 10214794664928, 127417290645600, 2621909765268000, 72022987084456800, 901477331317620000, 18550011589271100000, 509562633622531860000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 7075*a(n-3) for n>10.
|
|
EXAMPLE
|
Some solutions for n=4:
..1..1..0..0..3..1..1..2....2..3..1..2..1..1..0..2....2..3..0..0..1..0..1..0
..0..0..2..0..0..2..1..1....3..3..1..1..2..1..1..0....3..0..0..2..0..0..1..1
..1..0..0..1..0..0..3..1....1..1..2..1..1..3..1..1....0..0..1..0..0..2..3..3
..3..1..0..0..1..0..0..2....3..1..1..0..1..1..2..1....3..3..0..0..1..3..3..0
..3..3..1..0..0..3..0..2....0..2..1..1..0..1..1..0....2..3..0..1..3..3..2..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|