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.

A269069 Number of n X n binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.

Original entry on oeis.org

2, 11, 123, 3288, 165607, 18220241, 4064720816, 1833956006577, 1778703508587227, 3374673365461249568, 14101540722268888633757, 114651904507399541002097761, 2060026489521744559823250922304, 72580676762280474254836112626897875
Offset: 1

Views

Author

R. H. Hardin, Feb 19 2016

Keywords

Comments

Diagonal of A269075.

Examples

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

Crossrefs

Cf. A269075.