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.

A183601 1/6 the number of (n+1)X8 0..2 arrays with every 2X2 subblock containing all three values.

Original entry on oeis.org

47040, 4187499, 325834456, 26108240340, 2083981368760, 166653005250320, 13330538464876654, 1066653925785997106, 85362766209466105480, 6832162755933155019668, 546857478389624808674648
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Column 7 of A183603

Examples

			Some solutions with a(1,1)=0 for 3X8
..0..0..0..1..0..1..0..2....0..0..0..1..0..2..1..0....0..0..0..0..0..1..2..1
..2..1..2..1..2..1..2..1....2..1..2..2..1..0..1..2....2..1..2..1..2..0..2..0
..1..0..0..0..2..0..1..0....1..0..0..1..0..2..0..2....0..1..0..0..0..1..1..0