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.

A286973 Number of n X 2 0..1 arrays with the number of 1's horizontally or vertically adjacent to some 0 two less than the number of 0's adjacent to some 1.

Original entry on oeis.org

0, 0, 5, 30, 126, 520, 2088, 8192, 32083, 125728, 492331, 1927334, 7545086, 29542032, 115713230, 453479812, 1778221568, 6976989468, 27390464896, 107590106636, 422842742731, 1662688326476, 6541232413273, 25746371202362, 101384373381977, 399406874608396, 1574130883669277
Offset: 1

Views

Author

R. H. Hardin, May 17 2017

Keywords

Examples

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

Crossrefs

Column 2 of A286979.