88384
domain: N
Appears in sequences
- a(n) = Sum_{k=0..floor(n/3)} C(n-k,2*k) * 2^k * (-2)^(n-3*k).at n=14A099784
- a(n) is the number of ways to evaluate a bivariate polynomial of the form p(T,X) = p00 + T * q(X) where q(X) is an univariate polynomial of degree n. Each addition or multiplication takes exactly two arguments, and two parenthesizations which are equal modulo commutativity are considered as a unique way to evaluate p(T,X).at n=3A173157
- G.f. satisfies: A(x) = Sum_{n>=0} x^n*[Sum_{k=0..n} C(n,k)^2 *x^k* A(x)^(2k)].at n=10A183876
- Row 4 of array in A265080.at n=16A265081
- Expansion of e.g.f. csc(x)*(1 - sqrt(1 - 4*sin(x)))/2.at n=6A295237