1,2

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.

Table of n, a(n) for n=1..80.

Cf. A095163, A001462.

Sequence in context: A072505 A095163 A033677 * A117818 A073890 A079311

Adjacent sequences: A116545 A116546 A116547 * A116549 A116550 A116551

nonn

Franklin T. Adams-Watters, Mar 16 2006

approved