OFFSET
0,6
FORMULA
a(n) = Sum_{i >= 0} binomial(n-3*i, 2*i) * binomial(2*i,i).
D-finite with recurrence: n*a(n) = (2*n-1)*a(n-1) - (n-1)*a(n-2) + (4*n-10)*a(n-5).
a(n) = Sum_{i=0..floor(n/5)} multinomial(n-3*i; i, i, n-5*i). - Alois P. Heinz, Sep 08 2025
a(n) = hypergeom([(1-n)/5, (2-n)/5, (3-n)/5, (4-n)/5, -n/5], [1, (1-n)/3, (2-n)/3, -n/3], 5^5/3^3). - Stefano Spezia, Sep 09 2025
G.f.: 1 / sqrt((1-x)^2 - 4*x^5). - Seiichi Manyama, Jan 18 2026
EXAMPLE
For n=5, the a(5)=3 tilings are: all squares, domino-tromino, and tromino-domino.
MATHEMATICA
Table[Sum[Binomial[n-3i, 2i]*Binomial[2i, i], {i, 0, n/5}], {n, 0, 38}]
PROG
(PARI) my(N=40, x='x+O('x^N)); Vec(1/sqrt((1-x)^2-4*x^5)) \\ Seiichi Manyama, Jan 18 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Greg Dresden and Anna Kalynchuk, Sep 02 2025
STATUS
approved
