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.

A269269 Number of n X n 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three exactly once.

Original entry on oeis.org

0, 108, 46872, 74853576, 542973139128, 19356924219624936, 3516906597130333936872, 3322606082327701612506093240, 16524782213263820847479975782463640
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2016

Keywords

Comments

Diagonal of A269276.

Examples

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

Crossrefs

Cf. A269276.