489341

Appears in sequences

• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UDDU's starting at level 1.at n=43A135328
• Number of Dyck paths of semilength n having no UDDU's starting at level 1.at n=13A135334
• Expansion of e.g.f. exp(-x) / (1 + log(1 - x)).at n=8A330149
• Number of positive numbers that can be built with n ones using +, -, and *, and require at least n ones.at n=42A348083