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.

A302005 Number of n X n 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 8, 240, 25808, 9989376, 13918667808, 69786476414080, 1259406594247832896, 81801738558534434812512, 19123141293346274424868082896, 16090014430301966976090685132636800
Offset: 1

Views

Author

R. H. Hardin, Mar 30 2018

Keywords

Comments

Diagonal of A302010.

Examples

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

Crossrefs

Cf. A302010.