10584000

Appears in sequences

• Pseudo Galois numbers for d=15.at n=2A028677
• a(n) = smallest number m such that UnitarySigma(m) = n*m/(n-1).at n=11A145680
• Number of (n+1) X (n+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.at n=5A206086
• Number of (n+1) X 7 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.at n=5A206092
• Greatest common divisor of (x^m+y^m+(x+y)^m) - (z^m+t^m+(z+t)^m) over all x,y,z,t such that x^2 + xy + y^2 = z^2 + zt + t^2 and m=2n.at n=2A238595
• Numbers k such that uphi(k)/phi(k) > uphi(m)/phi(m) for all m < k, where phi(k) is the Euler totient function (A000010) and uphi(k) is the unitary totient function (A047994).at n=32A283052
• Numbers n such that sigma(n)/usigma(n) > sigma(m)/usigma(m) for all m < n, where sigma(n) is the sum of divisors of n (A000203) and usigma(n) is the sum of unitary divisors of n (A034448).at n=38A285906
• Coreful 4-abundant numbers: numbers k such that csigma(k) > 4*k, where csigma(k) is the sum of the coreful divisors of k (A057723).at n=0A340110
• Triangle read by rows: T(n,k) is the number of ordered partitions of [n] into k nonempty subsets, in which the first subset has size at least 2, n >= 1 and 1 <= k <= n.at n=51A348576
• Powerful numbers that have more divisors than any smaller powerful number.at n=39A377138
• E.g.f. A(x) satisfies A(x) = 1 + x*A(x) * (exp(x^2*A(x)^2) - 1).at n=10A392957