111930

Appears in sequences

• Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=42A000332
• Number of compositions of n into 5 ordered relatively prime parts.at n=38A000743
• Binomial coefficient C(3n,n-10).at n=4A004328
• Binomial coefficient C(6n,n-3).at n=4A004358
• Binomial coefficient C(7n,n-2).at n=4A004370
• Binomial coefficient C(42,n).at n=4A010958
• Binomial coefficient C(n,38).at n=4A010991
• Binomial coefficients C(2*n+4,4).at n=19A053134
• Products of exactly 6 distinct primes.at n=26A067885
• a(n) = binomial(sigma(n),tau(n)), where sigma(n) is the sum and tau(n) the number of divisors of n (A000203, A000005).at n=25A068904
• a(n) = rad(n*(n+1)*(n+2)*(n+3)).at n=38A078638
• First occurrence (*2) of n in A088627 - or - least number that yields n different primes if you factorize it in all possible ways in two factors and add these factors.at n=25A091350
• a(n) = binomial(Catalan(n), 4).at n=5A119549
• Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k + 2, n-k), for n>=k>=0.at n=40A121336
• a(n) = binomial(n, smallest non-divisor of n).at n=41A242342
• Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).at n=20A285615
• p-INVERT of (1,0,0,0,0,1,0,0,0,0,0,0,...), where p(S) = 1 - S^2.at n=51A292403
• Numbers k with a record number of divisors d < sqrt(k) such that d + k/d is prime.at n=11A331665
• Numbers k > 2 such that omega(k) > log(log(k)) + 2 * sqrt(log(log(k))), where omega(k) is the number of distinct primes dividing k (A001221).at n=36A336910
• Squarefree 3-abundant numbers: squarefree numbers k such that A000203(k) > 3*k.at n=20A387153