215481

Appears in sequences

• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at an odd height.at n=49A101920
• Expansion of e.g.f. 1/(1 - 3 * x * (exp(x) - 1)).at n=7A367881
• Number of compositions of 5*n-1 into parts 4 and 5.at n=17A369849
• a(n) = Sum_{k=0..floor(n/2)} binomial(k+1,2*n-4*k+1).at n=42A392489