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.

A269081 Number of 7Xn binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.

Original entry on oeis.org

128, 1760, 43959, 742688, 14011359, 236272677, 4064720816, 67174864630, 1109043586715, 17995383255288, 290431722641261, 4645047826683577, 73887191299532384, 1168678595574438796, 18400291710723401503
Offset: 1

Views

Author

R. H. Hardin, Feb 19 2016

Keywords

Comments

Row 7 of A269075.

Examples

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

Crossrefs

Cf. A269075.