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.

A268632 Number of n X n 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two exactly once.

Original entry on oeis.org

0, 24, 840, 47640, 5419992, 1328460312, 725187096504, 897937832100888, 2550310193527246056, 16737195174968513278656, 255111495114527014241534160, 9064348272085612349020943764248, 752834148761621410865592159869765856
Offset: 1

Views

Author

R. H. Hardin, Feb 09 2016

Keywords

Comments

Diagonal of A268639.

Examples

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

Crossrefs

Cf. A268639.