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.

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

Original entry on oeis.org

32, 2048, 81105, 3742524, 170243005, 7790212998, 356575568843, 16322570202905, 747207636738251, 34205652494216087, 1565866504708915868, 71682283388175729699, 3281474035612238093148, 150219433611860316291070
Offset: 1

Views

Author

R. H. Hardin, Feb 18 2018

Keywords

Comments

Column 6 of A299740.

Examples

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

Crossrefs

Cf. A299740.