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.

A269005 Number of n X n binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once.

Original entry on oeis.org

0, 4, 46, 2136, 109058, 14382480, 3258530608, 1582785864320, 1554970236400402, 3055129067325800608, 12891237725516640144940, 106775629834644247372248448, 1932363567303596958505554161216, 68821810412730939070416537380998580
Offset: 1

Views

Author

R. H. Hardin, Feb 17 2016

Keywords

Comments

Diagonal of A269011.

Examples

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

Crossrefs

Cf. A269011.