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.

A207846 Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically.

Original entry on oeis.org

6, 36, 72, 180, 432, 1044, 2520, 6084, 14688, 35460, 85608, 206676, 498960, 1204596, 2908152, 7020900, 16949952, 40920804, 98791560, 238503924, 575799408, 1390102740, 3356004888, 8102112516, 19560229920, 47222572356, 114005374632
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2012

Keywords

Comments

Row 3 of A207845.

Examples

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

Crossrefs

Cf. A207845.

Formula

Empirical: a(n) = 2*a(n-1) + a(n-2) for n>3.
Conjectures from Colin Barker, Jun 25 2018: (Start)
G.f.: 6*x*(1 + 4*x - x^2) / (1 - 2*x - x^2).
a(n) = 9*(sqrt(2)*((1-sqrt(2))^n*(1+sqrt(2)) + (-1+sqrt(2))*(1+sqrt(2))^n)) for n>2.
(End)