[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A209516
Number of (n+1) X 8 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.
1
3813753, 2505266673, 1701725703867, 1170258116647953, 808953988260058047, 560493388203596285283, 388756746462464273412765, 269773510833311326186049823, 187249435580728303988081172345
OFFSET
1,1
COMMENTS
Column 7 of A209517.
LINKS
EXAMPLE
Some solutions for n=4:
..2..1..0..2..1..2..2..1....2..2..2..2..1..0..2..0....2..0..1..2..2..1..1..1
..1..0..1..0..2..0..2..1....1..2..2..1..1..0..2..2....1..2..0..1..2..2..1..1
..0..2..0..0..0..1..0..2....0..1..1..2..2..1..0..2....0..1..2..0..1..2..2..1
..1..0..2..0..0..1..1..0....1..0..0..1..1..0..2..1....2..0..1..2..0..1..1..0
..0..1..0..1..0..0..0..0....0..1..0..0..0..0..2..1....1..2..0..1..2..0..0..2
CROSSREFS
Sequence in context: A186615 A175890 A083601 * A159825 A185533 A206413
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 09 2012
STATUS
approved