59917

Appears in sequences

• Number of 'tree-like curves' with n intersection points.at n=8A118814
• G.f. satisfies: A(x) = 1 + x*A(x)^2 + x^2/A(x)^3.at n=11A201970
• a(n) = max{T(n,k), k=1..n}, where T(n,k) is the number of Dyck paths of length 2n and height k (1<=k<=n).at n=11A259885
• Number of Dyck paths of semilength n and height exactly 4.at n=12A262600
• Least inverse of A073454: Smallest m such that m divided by the primes up to m have exactly n repeated residues.at n=31A274320
• Number of Dyck paths of semilength 3*n and height n.at n=4A289473
• Number A(n,k) of Dyck paths of semilength k*n and height n; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=32A289481
• Number of subsets of {1..n} of which every subset has a different sum.at n=30A325864