A162900 a(1)=1. For n>=2, a(n) = the smallest integer > a(n-1) such that GCD(n,a(n)) = p^k, where p = prime, k >= 1.

1, 2, 3, 4, 5, 8, 14, 16, 18, 22, 33, 34, 39, 40, 42, 44, 51, 52, 57, 58, 60, 62, 69, 70, 75, 76, 78, 80, 87, 88, 93, 94, 96, 98, 100, 104, 111, 112, 114, 115, 123, 124, 129, 130, 132, 134, 141, 142, 147, 148, 150, 152, 159, 160, 170, 172, 174, 176, 177, 178, 183, 184