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.

A183718 1/20 of the number of (n+1) X 9 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease.

Original entry on oeis.org

985, 18566, 303170, 5374440, 94463507, 1680902120, 29887741084, 532844962952, 9498797049301, 169444214222538, 3022597001362206, 53927539247910656, 962146234750661827, 17166919088214504572, 306297928172424966016
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2011

Keywords

Comments

Column 8 of A183719.

Examples

			Some solutions for 3 X 9:
..0..2..0..1..0..2..0..2..1....0..3..0..4..0..3..4..3..0
..4..3..4..2..4..3..4..3..0....1..2..1..2..1..2..1..2..1
..1..2..0..1..0..2..0..2..1....0..3..4..3..0..3..0..3..4
...
...R..L..R..L..R..L..R..L.......L..R..L..R..L..R..L..R...
...L..R..L..R..L..R..L..R.......R..L..R..L..R..L..R..L...