1003520

Appears in sequences

• a(n) = gcd(d(n!^3), d(n!)), where d() is the number of divisors function.at n=43A069783
• Triangle read by rows. T(n, k) = n^(n - k) * |Stirling1(n, k)|.at n=41A355006
• Irregular triangle read by rows: T(n,k), 2 <= n , 3 <= k <= largest k such that A067175(k) <= n , is the smallest n-digit number m such that omega(m) = A001221(m) = k, and its largest prime factor equals the sum of its remaining prime factors. or -1 if no such number exists.at n=15A383677