249661

Appears in sequences

• For n>=1, smallest integer k such that for all m>=k: m^(1/n)+(m+1)^(1/n) >= (2^n*m+2^(n-1)-1)^(1/n).at n=20A340163
• a(n) is the least k such that n*k-1 has exactly n prime factors, counted with multiplicity.at n=20A366857
• a(n) = Sum_{1 <= x_1, x_2, x_3, x_4 <= n} ( n/gcd(x_1, x_2, x_3, x_4, n) )^2.at n=7A372963