a(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.
A059391
a(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.
Terms
- a(0) =4a(1) =27a(2) =208a(3) =18630a(4) =780856896
External references
- oeis: A059391