780856896domain: NAppears in sequencesa(1)=4; a(n) is the smallest number m > a(n-1) such that Omega(m + a(i)) = Omega(m) - Omega(a(i)) for i = 1..(n-1) where Omega(k) is the number of prime divisors of k counted with multiplicity.at n=4A059391