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.

A286214 Number of n X 6 0..1 arrays with the number of 1's king-move adjacent to some 0 two less than the number of 0's adjacent to some 1.

Original entry on oeis.org

1, 912, 34896, 2053994, 113258929, 6553131164, 380797680269, 22418184755710, 1330080388106827, 79466576915681740, 4775393278095153395, 288397740505442452180, 17492553727454266741242, 1065040889415828916901252
Offset: 1

Views

Author

R. H. Hardin, May 04 2017

Keywords

Comments

Column 6 of A286216.

Examples

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

Crossrefs

Cf. A286216.