58785

Appears in sequences

• Catalan numbers - 1.at n=9A001453
• a(n) = Sum_{k|n} mu(k)*Catalan(n/k) (mu = Moebius function A008683).at n=10A002996
• Triangle read by rows: T(n,k) is number of Dyck paths of semilength n and having leftmost valley at altitude k (if path has no valleys, then this altitude is considered to be 0).at n=58A097607
• a(n) = C(n)-1+0^n where C(n) = A000108(n).at n=11A141364
• Triangle read by rows: T(n,k) = T(n,k-1) + T(n-1,k), T(n,0)=1, T(n,n) = T(n,n-1) + 1.at n=75A283054
• Number T(n,k) of set partitions of [n], where k is minimal such that for all j in [n]: j is member of block b implies b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; triangle T(n,k), n >= 0, 0 <= k <= max(floor(n/2), n-2), read by rows.at n=49A287640
• Number of Dyck paths of semilength n such that no level has more than ten peaks.at n=11A287974
• Number of ordered rooted trees with n non-root nodes and all outdegrees <= ten.at n=11A291825
• a(0) = 1 and a(n) = Sum_{k = 0..3*n} n/(n + 2*k)*binomial(n + 2*k,k) for n >= 1.at n=3A352276
• Number of integer compositions of n whose leaders of weakly decreasing runs are identical.at n=24A374742
• Triangle read by rows: T(n,k) = number of heapable permutations of length n whose longest decreasing subsequence has length k.at n=37A390146