%N a(n) = smallest divisor d of n that occurs earlier in the sequence fewer than a(d) times.
%C When n is prime, no smaller divisor is available, so a(n) = n. It can be shown than a(n) < n if n is composite. Similar to Golomb's sequence (A001462), but with the added condition that a(n) divides n.
%Y Cf. A095163, A001462.
%A _Franklin T. Adams-Watters_, Mar 16 2006