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.

A268743 Number of n X n binary arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once.

Original entry on oeis.org

2, 11, 143, 4110, 255651, 34732937, 10319681062, 6744840113811, 9736268648482947, 31152408949342676906, 221573405414594347811555, 3511390061199964238627005057, 124222798189336185449669887550302
Offset: 1

Views

Author

R. H. Hardin, Feb 12 2016

Keywords

Comments

Diagonal of A268750.

Examples

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

Crossrefs

Cf. A268750.