1081575

Appears in sequences

• a(n) = binomial coefficient C(n,8).at n=17A000581
• Binomial coefficient C(25,n).at n=8A010941
• Binomial coefficient C(25,n).at n=17A010941
• a(n) = binomial(n,17).at n=8A010970
• Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=19A024760
• a(n) = binomial(2n+1,n-4).at n=8A030054
• a(n) = binomial(n, floor((n-8)/2)).at n=25A037958
• a(n) = binomial(3*n+1,n).at n=8A045721
• Partial sums of A051947.at n=17A050483
• a(n) = binomial(n, floor(n/3)).at n=25A051033
• Binomial coefficients C(2*n-7,8).at n=8A053130
• Central column of triangle A065941.at n=17A065942
• First differences of coefficients of g.f. (1-x)^24.at n=7A078488
• Number of walks of length n between two adjacent nodes in the cycle graph C_9.at n=23A095364
• a(n) = binomial(floor((3n+2)/2), floor(n/2)).at n=16A099578
• Triangle read by rows: T(n,k) is the number of nonroot nodes of outdegree k (0<=k<=n-1) in all non-crossing trees with n edges.at n=36A100400
• Triangle read by rows: T(n, k) = binomial(3*n+1-k, n-k) for n, k >= 0.at n=36A144484
• Triangle T(n,k) = binomial(3*n+1, 2*n+k+1), read by rows.at n=36A159841
• Triangle: T(n,k)=C(4n+1,2k), 0<=k<=n.at n=25A193634
• Irregular triangle read by rows: T(n,k) is the number of labeled relations on n nodes with exactly k edges; n>=0, 0<=k<=n^2.at n=43A217285