480700

Appears in sequences

• a(n) = binomial coefficient C(n,7).at n=18A000580
• Binomial coefficient C(25,n).at n=7A010941
• Binomial coefficient C(25,n).at n=18A010941
• a(n) = binomial(n,18).at n=7A010971
• Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted, duplicates removed.at n=24A024759
• Binomial((n+1)^2, prime(n)).at n=3A030031
• a(n) = binomial(2*n+1, n-5).at n=7A030055
• T(n,7), array T as in A050186; a count of aperiodic binary words.at n=18A051192
• Binomial coefficients C(2*n+7,7).at n=9A053136
• First differences of coefficients of g.f. (1-x)^24.at n=17A078488
• G.f.: (1-16*x+28*x^2+56*x^3-140*x^4+56*x^5+28*x^6-16*x^7+x^8)/(x^2-x+1)^8.at n=18A112403
• Triangle read by rows: T(n,k) = binomial(3*n-k,n-k).at n=47A119301
• a(n) = binomial(n, sum_digits_n).at n=25A128936
• a(n) = binomial(floor(n*sqrt(2)),n) for n>=0.at n=18A135964
• Triangle T(n,k) = binomial(3*n+1, 2*n+k+1), read by rows.at n=37A159841
• a(n) = Sum_{j=1..floor(n/2)} binomial(n+j-1,j-1).at n=16A175167
• 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=42A217285
• 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=53A217285
• a(n) = binomial(3n+1, n-1).at n=7A236194
• Triangle read by rows: T(n,k) = binomial(k,n-k)*binomial(n+2*k,n+k) /(n+k+1), n>=0, 0<=k<=n.at n=53A243163