73815

Appears in sequences

• Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=38A000332
• Binomial coefficient C(38,n).at n=4A010954
• Binomial coefficient C(n,34).at n=4A010987
• a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).at n=34A023095
• Binomial coefficients C(2*n+4,4).at n=17A053134
• a(n) = lcm(n, n+1, n+2, n+3)/12.at n=34A067047
• Number of orbits of the wreath product of S_n with S_n on n X n matrices over {0,1,2,3}.at n=4A099122
• Coordination sequence for 24-dimensional cyclotomic lattice Z[zeta_35].at n=4A126925
• List of numbers that are both pentagonal (A000326) and binomial coefficients C(n,4) (A000332).at n=24A145920
• Products of 5 distinct primes a,b,c,d,e, such that a+b+c+d+e are prime numbers.at n=14A178782
• Number of -n..n arrays of 4 elements with first and second differences also in -n..n.at n=10A201089
• a(n) = binomial(n, d(n)), where d(n) = A000005(n) is the number of divisors of n.at n=37A204292
• Array read by antidiagonals: A(n,k) is the number of n element multisets of n element multisets of a k-set.at n=40A331436
• Number of n element multisets of n element multisets of an n-set.at n=4A331477
• Composite squarefree numbers k = Product_{i} p_i such that k^2 is divisible by Sum_{i} p_i^2.at n=5A332738
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -1.at n=10A380888
• Squarefree numbers k such that the sum of 1/(p-1) over the prime divisors p of k is 1.at n=2A381507