1,1

A000005(n) <= A000005(a(n)) and A000005(k) < A000005(n) for n<k<a(n);

A000005(2*k-1) <= A000005(2*k) for 1<=k<=22. - Corrected by Robert Israel, Jul 23 2019

Robert Israel, Table of n, a(n) for n = 1..10000

N:= 1000: # for all terms before the first term > N

taus:= map(numtheory:-tau, [$1..N]):

for n from 1 to N do

found:= false:

for k from n+1 to N while not found do

if taus[k]>=taus[n] then found:= true; A[n]:= k fi

od;

if not found then break fi

od:

seq(A[i], i=1..n-1); # Robert Israel, Jul 23 2019

Cf. A079427, A112276.

Cf. A138171 (odd n for which a(n) > n+1).

Sequence in context: A214965 A134361 A142727 * A335876 A306974 A278400

Adjacent sequences: A112272 A112273 A112274 * A112276 A112277 A112278

nonn

Reinhard Zumkeller, Sep 01 2005

approved