OFFSET
0,3
COMMENTS
We define two types of plane triangles - up-triangles with vertices at the integer lattice points (x, y), (x+1, y+1) and (x+2, y) and down-triangles with vertices at the integer lattice points (x, y), (x-1, y+1) and (x+1, y+1). The area beneath a small Schröder path may be decomposed in a unique manner into a collection of up- and down-triangles. This decomposition produces a triangle stack in the sense of A224704. Here we are counting triangle stacks containing n up-triangles. See the Links section for an illustration.
LINKS
FORMULA
O.g.f. as a continued fraction: (u marks up-triangles)
A(u) = 1/(1 - u/(1 - u - u^2/(1 - u^2 - u^3/(1 - u^3 - u^4/(1 - u^4 - (...) ))))) = 1 + u + 2*u^2 + 5*u^3 + 12*u^4 + ....
A(u) = 1/(1 - u/(1 - (u + u^2)/(1 - u^3/(1 - (u^2 + u^4)/(1 - u^5/(1 - (u^3 + u^6)/(1 - u^7/( (...) )))))))).
A(u) = 1/(2 - (1 + u)/(2 - (1 + u^2)/(2 - (1 + u^3)/(2 - (...) )))).
A(u) = N(u)/D(u), where N(u) = Sum_{n >= 0} u^(n^2+n)/ Product_{k = 1..n} ((1 - u^k)^2) and D(u) = Sum_{n >= 0} u^(n^2)/ Product_{k = 1..n} ((1 - u^k)^2).
a(n) ~ c*d^n, where c = 0.29475 98606 22204 98206 41002 ..., d = 2.51457 96438 78729 18851 04371 ....
Row sums of A326792.
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Jul 25 2019
STATUS
approved