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.

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

Original entry on oeis.org

2, 16, 114, 1849, 86355, 9259849, 2215586241, 1207251562500, 1504250577851460, 4240840118917220289, 26956572348445823078057, 387211891430119861291459849, 12581321412478916326490284012715, 923581786817019708657060682986420624
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Diagonal of A207741

Examples

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