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.

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

Original entry on oeis.org

3, 42, 594, 24192, 1643376, 242861616, 71430596250, 43961616939276, 56121206116838532, 149312689805356303800, 836315757545942679945480, 9777884421682321788379713444, 242268002268280142077867206348378
Offset: 1

Views

Author

R. H. Hardin, Feb 18 2016

Keywords

Comments

Diagonal of A269052.

Examples

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

Crossrefs

Cf. A269052.