20349

Appears in sequences

• Binomial coefficients C(n,5).at n=21A000389
• Coefficients of Legendre polynomials.at n=5A001796
• Binomial coefficients C(2*n+5,5).at n=8A002299
• 4-dimensional figurate numbers: a(n) = (5*n-1)*binomial(n+2,3)/4.at n=17A002418
• a(n) = binomial(3n+6, n).at n=5A003408
• Triangle of coefficients of expansions of powers of x in terms of Legendre polynomials P_n(x) over common denominator.at n=36A008317
• Binomial coefficient C(21,n).at n=5A010937
• Binomial coefficient C(21,n).at n=16A010937
• a(n) = binomial(n,16).at n=5A010969
• Triangular array formed from odd elements to right of middle of rows of Pascal's triangle.at n=51A014475
• Binomial coefficients: C(n,k), 5 <= k <= n-5, sorted, duplicates removed.at n=22A024757
• a(n) = binomial(2*n+1, n-5).at n=5A030055
• T(n,5), array T as in A050186; a count of aperiodic binary words.at n=16A050190
• a(n) = binomial(n, floor(n/4)).at n=21A051036
• a(n) = (4n+1)*binomial(4n,n)/(3n+1).at n=5A052203
• Expansion of 1/(1 - 3*x^2 - x^3).at n=17A052931
• a(n) = binomial(n, round(sqrt(n))).at n=21A055789
• Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2).at n=57A062734
• Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=35A065903
• Triangle read by rows: T(n,k) = C( C(n,2), k) for n >= 0, 0 <= k <= C(n,2).at n=47A084546