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.

A279704 Number of n X 3 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

1, 3, 11, 42, 161, 617, 2364, 9057, 34699, 132938, 509309, 1951253, 7475596, 28640333, 109726191, 420380482, 1610552121, 6170310577, 23639553244, 90567317577, 346979442819, 1329339732698, 5092936084549, 19511940644893
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2016

Keywords

Examples

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

Crossrefs

Column 3 of A279709.

Formula

Empirical: a(n) = 5*a(n-1) - 5*a(n-2) + 2*a(n-3).
Empirical g.f.: x*(1 - x)^2 / (1 - 5*x + 5*x^2 - 2*x^3). - Colin Barker, Feb 11 2019