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.

A203492 Number of 2Xn 0..2 arrays with row sums equal and column sums unequal to adjacent columns.

Original entry on oeis.org

3, 10, 80, 556, 3348, 20596, 134412, 888232, 5836068, 38457456, 255381636, 1704162724, 11399565860, 76433483528, 513785171540, 3461284463632, 23360156262164, 157908381404144, 1068981156413892, 7246198178206132
Offset: 1

Views

Author

R. H. Hardin Jan 02 2012

Keywords

Comments

Row 2 of A203491

Examples

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