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.

A202745 Number of 4Xn 0..1 arrays with row sums equal and column sums unequal to adjacent columns.

Original entry on oeis.org

2, 10, 86, 838, 6870, 62398, 613950, 6018166, 59293518, 601267870, 6215708078, 64727555230, 679456522670, 7200537529326, 76879249259246, 825573117666246, 8913831877350462, 96733061472889806, 1054372579551732366
Offset: 1

Views

Author

R. H. Hardin Dec 23 2011

Keywords

Comments

Row 4 of A202742

Examples

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