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.

A203488 Number of n X 5 0..2 arrays with row sums equal and column sums unequal to adjacent columns.

Original entry on oeis.org

48, 3348, 170868, 8518564, 421158558, 20726134056, 1022868051652, 50561285393908, 2503295874466950, 124208845614214498, 6167894219771885242, 306989800251437858776, 15307714522320704176494, 764702726505274412235480
Offset: 1

Views

Author

R. H. Hardin, Jan 02 2012

Keywords

Comments

Column 5 of A203491.

Examples

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

Crossrefs

Cf. A203491.