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.

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

Original entry on oeis.org

0, 80, 13904, 7002040, 12637025328, 88082672552208, 2456638851763181776, 279573979783982763379528, 131383670545605944288719844352, 256961574793195204388371517319842144
Offset: 1

Views

Author

R. H. Hardin, Feb 20 2016

Keywords

Comments

Diagonal of A269152.

Examples

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

Crossrefs

Cf. A269152.