629850

Appears in sequences

• Number of diagonal dissections of a convex n-gon into n-4 regions.at n=8A002055
• a(n) = (n+3)*binomial(n+8, 8)/3.at n=12A053310
• Expansion of (1+5*x)/(1-x)^10.at n=11A055848
• Numbers k such that sopfr(k) = ud(k), where sopfr = A001414 and ud = A034444.at n=15A064029
• a(n) = binomial(2n, n) + binomial(2n-1, n-1) + binomial(2n+1, n).at n=10A184937
• Number of words of length 2n such that all letters of the nonary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word.at n=1A258496
• Triangle read by rows: T(n, k) = binomial(2*n, n + k) * binomial(n + 1, k)/(n + 1).at n=57A286784
• a(n) = ( binomial(5*n,2*n)*binomial(5*n/2,2*n)*binomial(2*n,n)^2 ) / binomial(5*n/2,n)^2.at n=4A352651