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.

A203558 Number of nX2 0..2 arrays with row sums equal and column sums equal.

Original entry on oeis.org

3, 9, 9, 33, 53, 183, 395, 1249, 3141, 9459, 25655, 75639, 212943, 623093, 1787609, 5222369, 15134933, 44250051, 128996855, 377748883, 1105350731, 3242546393, 9513228125, 27953744695, 82176836303, 241834027353, 712070156205
Offset: 1

Views

Author

R. H. Hardin Jan 03 2012

Keywords

Comments

Column 2 of A203564

Examples

			Some solutions for n=5
..1..1....2..2....2..0....2..2....0..0....1..1....1..1....2..0....0..0....2..2
..1..1....2..2....1..1....2..2....0..0....0..2....0..2....1..1....0..0....2..2
..2..0....2..2....1..1....2..2....0..0....2..0....2..0....2..0....0..0....2..2
..1..1....2..2....1..1....2..2....0..0....2..0....0..2....0..2....0..0....2..2
..0..2....2..2....0..2....2..2....0..0....0..2....2..0....0..2....0..0....2..2