%N Lexicographically earliest sequence of distinct terms, with a unique fixed point, such that a^n(n)=n, for any n>0 (where a^n denotes the n-th iterate of a).
%C The unique fixed point constraint ensures that this sequence differs from A000027.
%C This is a permutation of the natural numbers, with inverse A256513.
%C The length of the orbit of n is a prime divisor of n, for any n>1.
%C GCD(n, a(n))>1, for any n>1.
%H Paul Tek, <a href="/A256508/b256508.txt">Table of n, a(n) for n = 1..10000</a>
%H Paul Tek, <a href="/A256508/a256508.pl.txt">Perl program for this sequence</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Iterated_function#Definition">Iterated function</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%o (Perl) See Links section.
%Y Cf. A256513.
%A _Paul Tek_, Mar 31 2015