225792840

Appears in sequences

• Binomial coefficient C(2n,n-4).at n=12A004310
• Binomial coefficient C(32,n).at n=12A010948
• Binomial coefficient C(32,n).at n=20A010948
• a(n) = binomial(n,12).at n=20A010965
• a(n) = binomial(n,20).at n=12A010973
• a(n) = binomial(n, floor((n-7)/2)).at n=32A037954
• a(n) = binomial(n, floor((n-8)/2)).at n=32A037958
• a(n) = binomial(sigma(n), phi(n)).at n=20A064366
• a(n) = binomial(composite(n), n), where composite = A002808, composite numbers.at n=19A064813
• a(n) = binomial(a,b) where a>=b and one of a and b is the product of the nonzero decimal digits of n and the other is the sum of the decimal digits of n.at n=48A067453
• Staircase on Pascal's triangle.at n=20A081205
• Weight enumerator of [32,31,2] Reed-Muller code RM(4,5).at n=6A110847
• Weight enumerator of [32,31,2] Reed-Muller code RM(4,5).at n=10A110847
• a(n) = binomial(floor(n*(sqrt(5)+1)/2), n) for n>=0.at n=20A135962
• Numbers whose square is the product of two distinct tetrahedral numbers A000292.at n=13A152005
• Triangle T(n, k, m) = round( Product_{j=0..m} binomial(2*(n+j), 2*(k+j))/binomial( 2*(n-k+j), 2*j) ), where m = 9, read by rows.at n=29A156742
• Triangle T(n, k, m) = round( Product_{j=0..m} binomial(2*(n+j), 2*(k+j))/binomial( 2*(n-k+j), 2*j) ), where m = 9, read by rows.at n=34A156742
• Triangle T(n,m) = binomial(4*n, 4*m), 0 <= m <= n, read by rows.at n=39A177808
• Triangle T(n,m) = binomial(4*n, 4*m), 0 <= m <= n, read by rows.at n=41A177808
• Triangle read by rows: n-th row (n>=0) gives coefficients of the polynomial ((x+1)^(2^n) + (x-1)^(2^n))/2.at n=26A201461