cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A209515 Number of (n+1) X 7 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.

Original entry on oeis.org

598491, 181445643, 56515446141, 17769569448759, 5607670578249789, 1772313933013227273, 560493388203596285283, 177302245070678360735145, 56092636774113844825575603, 17746700710940389030443863763
Offset: 1

Views

Author

R. H. Hardin, Mar 09 2012

Keywords

Comments

Column 6 of A209517.

Examples

			Some solutions for n=4:
..2..2..1..1..1..1..0....0..2..0..1..2..2..1....2..0..1..2..1..0..1
..0..0..2..1..1..1..0....1..0..2..0..1..2..1....1..2..0..1..0..1..1
..2..2..2..1..1..1..0....2..1..0..2..0..1..0....1..1..2..0..1..1..1
..1..1..1..2..1..1..1....2..1..1..0..2..0..0....0..0..1..2..0..0..0
..2..1..1..2..1..2..1....1..0..0..0..0..2..2....1..0..0..1..2..2..0