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.

A205311 Number of (n+1) X (n+1) 0..1 arrays with every 2 X 2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order.

Original entry on oeis.org

8, 84, 2606, 193664, 33865634, 13956665238, 13574876544398, 31191658416342676, 169426507164530254382, 2176592549084872196370726, 66158464020552857153017287242, 4759146677426447759184119036493678
Offset: 1

Views

Author

R. H. Hardin Jan 25 2012

Keywords

Comments

Diagonal of A205318.

Examples

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

Crossrefs

Cf. A205318.