92940
domain: N
Appears in sequences
- Number of ordered rooted trees with n non-root nodes and all outdegrees <= three.at n=12A036765
- Triangle read by rows: T(n,m) = number of T_0-multigraphs with n edges and m vertices(n>=2, 3<=m<=2*n).at n=33A093855
- Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UUUU's.at n=48A135305
- G.f. satisfies: A(x) = Sum_{n>=0} x^n*A(x)^n * Sum_{k=0..n} binomial(n,k)^2 * x^k*(1-x)^(n-k).at n=10A227824
- a(n) = A036765(n-1) if n>0, with a(0) = 1.at n=13A246555