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.

A207911 Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 0 1 1 vertically.

Original entry on oeis.org

18, 324, 1278, 5041, 39831, 314721, 1726758, 9474084, 62431074, 411400089, 2464567047, 14764437081, 92881236582, 584304302404, 3583711091042, 21979959981841, 136591044276099, 848823810045561, 5238992009252400
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Row 6 of A207908

Examples

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