106805

Appears in sequences

• a(n) = floor(Fibonacci(n)/n).at n=32A127884
• a(n) is the smallest number k larger than a(n-1) such that n*d(k)*sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).at n=28A134382
• a(n) is the least integer k such that sigma(k)/(d(k)*sopf(k)) = n where d=A000005, sigma=A000203 and sopf=A008472.at n=28A328174