48537domain: NAppears in sequencesa(n) = smallest number greater than a(n-1) having a largest proper divisor that is greater than and coprime to a(n-1); a(1) = 1.at n=40A098144a(n) = a(n-2)*2 + floor(sqrt(a(n-1))).at n=29A182559a(n) = Sum_{k=1..n} k^2*phi(k), where phi is the Euler totient function A000010.at n=22A319087