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.

A286211 Number of n X 3 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

0, 17, 52, 684, 2128, 34896, 123541, 1891998, 7565509, 106100847, 470286934, 6070072444, 29342743563, 352400491431, 1833102380708, 20699165970978, 114576111229319, 1227555854005393, 7163217232141967, 73387852919316000
Offset: 1

Views

Author

R. H. Hardin, May 04 2017

Keywords

Comments

Column 3 of A286216.

Examples

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

Crossrefs

Cf. A286216.