a(n) = gcd(n, A079892(n)), where A079892(n) is the least number > n having one more distinct prime factor than n.

A079893

a(n) = gcd(n, A079892(n)), where A079892(n) is the least number > n having one more distinct prime factor than n.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =2a(4) =1a(5) =6a(6) =1a(7) =2a(8) =1a(9) =10a(10) =1a(11) =6a(12) =1a(13) =2a(14) =15a(15) =2a(16) =1a(17) =6a(18) =1a(19) =10a(20) =3a(21) =2a(22) =1a(23) =6a(24) =1a(25) =2a(26) =1a(27) =2a(28) =1a(29) =30

External references