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.

A302385 Number of 6Xn 0..1 arrays with every element equal to 1, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

0, 361, 16451, 514655, 20993054, 849467774, 34271733937, 1383359844850, 55869034107773, 2256277862917399, 91119808168300632, 3679882775189443109, 148612776964178660961, 6001755395115442008533, 242382043501326104374522
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Row 6 of A302381.

Examples

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

Crossrefs

Cf. A302381.