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.

A206875 Number of 6 X n 0..1 arrays avoiding 0 0 0 horizontally and 1 0 1 vertically.

Original entry on oeis.org

37, 1369, 17737, 397221, 8373905, 159327093, 3254925997, 65503023421, 1306330464063, 26282885757023, 527346719280577, 10574042671627575, 212249791397406163, 4258527016456970551, 85440779581637659129
Offset: 1

Views

Author

R. H. Hardin, Feb 13 2012

Keywords

Comments

Row 6 of A206871.

Examples

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

Crossrefs

Cf. A206871.