OFFSET
1,2
LINKS
R. H. Hardin, Table of n, a(n) for n = 1..210
Sela Fried, Counting r X s rectangles in nondecreasing and Smirnov words, arXiv:2406.18923 [math.CO], 2024. See p. 12.
FORMULA
Empirical: a(n) = 4*a(n-1) - 4*a(n-2) for n>3.
Conjectures from Colin Barker, Feb 16 2019: (Start)
G.f.: x*(1 + 10*x + 4*x^2) / (1 - 2*x)^2.
a(n) = 7*2^(n-1) * (n-1) for n>1.
(End)
EXAMPLE
Some solutions for n=4:
..0..1..0. .0..1..1. .0..0..1. .0..1..0. .0..0..1. .0..0..0. .0..1..1
..1..1..0. .0..1..0. .1..0..1. .0..1..1. .1..1..0. .1..1..0. .1..0..1
..0..1..0. .0..1..0. .1..0..1. .1..0..1. .0..1..0. .0..1..0. .1..0..1
..0..1..0. .0..1..0. .1..1..0. .1..0..0. .0..1..0. .0..1..1. .0..1..0
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 17 2017
STATUS
approved