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.

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

Original entry on oeis.org

1, 8, 139, 5748, 496085, 97439921, 41966406867, 39919204098331, 84196647385137200, 391960289300558475785, 4034683591387591205214712, 91832712356420807374009031299, 4618825005074327343319160956639454
Offset: 1

Views

Author

R. H. Hardin, Mar 27 2018

Keywords

Comments

Diagonal of A301841.

Examples

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

Crossrefs

Cf. A301841.