A268972 Number of 2 X n 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.
9, 60, 240, 912, 3312, 11664, 40176, 136080, 454896, 1504656, 4933872, 16061328, 51963120, 167226768, 535692528, 1709114256, 5433452784, 17218688400, 54411055344, 171498136464, 539289320688, 1692252695952, 5299912289520
Offset: 1
Keywords
Examples
Some solutions for n=4: ..0..1..0..1. .2..2..1..2. .1..2..1..0. .2..1..0..0. .1..1..2..2 ..0..0..0..2. .2..2..2..2. .2..2..1..0. .2..1..2..2. .2..2..2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Row 2 of A268971.
Formula
Empirical: a(n) = 6*a(n-1) - 9*a(n-2) for n>4.
Conjectures from Colin Barker, Jan 17 2019: (Start)
G.f.: 3*x*(3 - x)*(1 + x - 4*x^2) / (1 - 3*x)^2.
a(n) = 16*3^(n-3) * (4*n+3) for n>2.
(End)