5821200

Appears in sequences

• Numbers that are sums of two or more consecutive (positive) cubes in more than 1 way.at n=14A062682
• Integers that can be expressed as a product of triangular numbers in 3 different ways.at n=27A110904
• Sequence terms are generated by solving the n x n linear algebra problem [H]x = b, where b is the unit vector. Only xn, the last unknown is used.at n=11A124261
• Denominators of partial sums of a certain series of inverse central binomial coefficients.at n=6A145565
• a(n) = 2*n*a(n-1) if the parity of the ratio a(n-1)/a(n-2) is odd, otherwise (for even parity) a(n) = (2n-1)*a(n-1).at n=8A177373
• a(0) = a(1) = 1, a(n) = n! / a(n-2).at n=15A214916
• Numbers that are sums of consecutive (positive) cubes in more than one way.at n=19A265845
• Least number k such that the number of its divisors is n times the number of its prime factors, counted with multiplicity.at n=28A275819
• If 2n = 2^e1 + 2^e2 + ... + 2^ek [e1 .. ek distinct], then a(n) = A002110(e1) * A002110(e2) * ... * A002110(ek).at n=27A283477
• 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=35A329882
• Partial products of squarefree semiprimes (A006881).at n=5A339191
• a(n) = n/(Sum_{k=1..n} 1/phi(A341813(n)*k)).at n=41A341814
• Irregular triangle read by rows: T(n,k) is the number of arrangements of n labeled children with exactly k rounds; n >= 2, 1 <= k <= floor(n/2).at n=28A349280
• Table read by rows: T(n, k) = A124320(n + 1, k) * A132393(n, k).at n=32A368583
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=25A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=26A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=27A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=28A368901
• a(n) is the difference between the number of n-dist-increasing and (n-1)-dist-increasing permutations p of [2n], where p is k-dist-increasing if k>=0 and p(i)<p(i+k) for all i in [2n-k].at n=6A370576
• Numbers whose cubes have more square divisors than the cube of any smaller number.at n=30A377141