4989600

Appears in sequences

• Number of permutations of an n-set containing an 8-cycle.at n=11A029575
• E.g.f.: x^3*log(1/(1-x)).at n=11A052759
• Denominator of Sum_{k=0..n} 1/k!.at n=11A061355
• a(1) = 1, a(n) = a(n-1) times largest nontrivial divisor if n is composite.at n=11A072487
• Triangle whose n-th row contains the n smallest numbers that are products of n distinct integers > 1, read by rows.at n=42A081957
• a(n) = (n+1)!/(d(n)*d(n+1)) where d(n) = cancellation factor in reducing Sum_{k=0...n} 1/k! to lowest terms.at n=10A123899
• T(n,k) is the number of permutations of [n] with maximum descent k, T(n,k) for n >= 0 and 0 <= k <= n, triangle read by rows.at n=63A130477
• Number of permutations of 1..n with the sequence of sums of 5 adjacent elements having exactly 1 maximum.at n=7A179724
• a(n) is the least number such that there are n semiprimes pq such that (p+1)(q+1) = a(n) for each semiprime.at n=25A180334
• Denominator of expression W_n occurring in analysis of bubble sort.at n=10A190187
• Augmentation of the triangle A004736. See Comments.at n=39A193561
• Pairs p, q for those partial sums p/q of the series e = sum_{n>=0} 1/n! that are not convergents to e.at n=19A233044
• Denominator of the sum of inverse products of parts in all partitions of n.at n=12A322365
• Nonunitary superabundant numbers: numbers m such that nusigma(m)/m > nusigma(k)/k for all k < m, where nusigma(m) is the sum of nonunitary divisors of m (A048146).at n=34A329882
• Integers m such that the number of divisors whose last digit equals the last digit of m sets a new record.at n=34A342833
• Table read by rows, T(n, k) = Y(2*n, k, Z(2*n - k)) where Y are the partial Bell polynomials and Z(m) is the list [A126869(j), j = 1..2*(m+1)].at n=24A350462
• Table read by rows, T(n, k) = Y(2*n, k, Z(2*n - k)) where Y are the partial Bell polynomials and Z(m) is the list [A126869(j), j = 1..2*(m+1)].at n=26A350462
• Irregular triangle T read by rows: T(n, k) gives the number of permutations of [n] = {1, 2, ..., n} with a cycle of length m = floor(n/2) + k = A138099(n, k), for 1 <= k <= n - floor(n/2) = ceiling(n/2).at n=32A364317
• Integers k such that A000010(k) <= A008480(k).at n=4A364750
• a(n) is the denominator of the probability that the free polyomino with binary code A246521(n+1) appears in the version of the Eden growth model described in A367671 when n square cells have been added.at n=22A367672