OFFSET
0,5
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..700 (terms n = 1..210 from R. H. Hardin)
Rigoberto Flórez, José L. Ramírez, Fabio A. Velandia, and Diego Villamizar, Some Connections Between Restricted Dyck Paths, Polyominoes, and Non-Crossing Partitions, arXiv:2308.02059 [math.CO], 2023. See Table 1 p. 13.
FORMULA
a(n) = 1 if n<=3 else Sum_{i=0..n-3} binomial(n-3,i)*a(i). Proved by R. J. Mathar in the Sequence Fans Mailing List.
EXAMPLE
Some solutions for n=11
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..1....1....0....1....1....1....0....1....1....1....1....1....1....1....1....0
..0....1....1....0....1....1....1....0....1....0....0....0....1....1....0....0
..1....1....0....1....0....1....1....0....1....1....0....1....1....1....1....1
..1....0....1....1....1....0....1....0....2....1....0....1....2....2....0....0
..2....2....0....2....2....2....0....0....0....1....1....0....1....2....0....0
..2....0....0....2....2....2....0....1....1....0....1....1....2....2....0....1
..2....1....0....1....0....1....2....0....1....0....2....0....2....2....1....1
..3....1....1....0....2....2....0....1....0....2....1....0....2....0....2....1
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 22 2012
EXTENSIONS
a(0)=1 prepended by Alois P. Heinz, Apr 24 2023
STATUS
approved