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.

A298085 Number of n X 6 0..1 arrays with every element equal to 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

0, 13, 7, 76, 520, 2767, 11202, 66148, 385999, 2040394, 11280309, 63669582, 352938921, 1954934444, 10928716512, 60920261087, 339016489892, 1890631777955, 10543750377805, 58766637746893, 327645644514925, 1827099377713191
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2018

Keywords

Comments

Column 6 of A298087.

Examples

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

Crossrefs

Cf. A298087.