|
|
A205822
|
|
Number of (n+1) X 8 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.
|
|
1
|
|
|
10032, 96402, 1002240, 12281976, 156410676, 2053746000, 27196042704, 362290015758, 4834444163676, 64590005130132, 863239060201212, 11540056054532778, 154281470426981232, 2062735520293913052
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4:
..2..1..2..0..2..0..0..0....0..0..0..0..2..1..2..1....0..2..1..1..0..0..2..2
..2..0..2..1..1..1..2..1....2..1..2..1..2..0..2..0....1..2..0..2..2..1..1..0
..1..1..2..0..2..0..2..0....2..0..0..0..2..1..1..1....0..2..1..1..0..0..2..0
..2..0..2..1..1..0..1..1....2..1..2..1..2..0..2..0....1..2..0..2..2..1..1..0
..1..1..2..0..2..0..2..0....0..0..2..0..2..1..1..0....0..2..1..1..0..0..2..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|