1108800

Appears in sequences

• a(n) = n(n+1)(n+2)...(n+8) / (n+(n+1)+(n+2)+...+(n+8)).at n=4A032780
• Triangle read by rows, the Bell transform of n!*binomial(5,n) (without column 0).at n=37A049411
• a(n)=Max{ (i+j)!/i!^2 | 0<=i,j<=n }.at n=8A096769
• Numerators of a Fibonacci related transform of 1/(n+1).at n=11A097346
• SuperRefactorable numbers: m=A005179(n) such that k=m/n is an integer.at n=32A110821
• a(n) = n!/A124901(n).at n=8A124903
• Numbers that set a record for number of even divisors: a(n) = 2*A002182(n).at n=35A181808
• Duplicate of A124903.at n=8A197954
• a(n) = v(n+1)/(8*v(n)), where v=A203524.at n=4A203525
• Positive numbers differing from next 3 greater squares by squares.at n=26A218487
• Terms of A005179 divisible by their indices in order of appearance in A005179.at n=34A262983
• Triangle read by rows: T(n,k) (n>=4, k=3..n-1) is the number of topologies t on n points having exactly k open sets such that t contains exactly one open set of size m for each m in {0,3,4,5,...,s,n} where s is the size of the largest proper open set in t.at n=33A268221
• Highly composite numbers of class 1 (see comment).at n=38A275239
• Least number k such that the number of its divisors is n times the number of its prime factors, counted with multiplicity.at n=19A275819
• Positions of records in A220400.at n=30A297160
• a(n) is the least k > 0 such that A303822(k) = 3^n.at n=17A303823
• Numbers k such that A095112(k)/k sets a new record.at n=28A307187
• Alphabetic length of a divide-and-conquer approach to the regular expression for permutations of n symbols.at n=11A320460
• a(n) is the number of distinct arrangements of the letters in the English word for n.at n=22A321971
• T(n,k) = [0<k<=n] * n*(T(n-1,k-1)+T(n-1,k)) + [k=0 and n>=0]; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.at n=42A326659