OFFSET
1,2
COMMENTS
Conjecture: for n > 1, a(n) is always one of n/2, n+1, 2*n+2, 2*n+3, 4*n+3 or 4*n+5. - Robert Israel, Feb 18 2020
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
N:= 100: # to get a(1)..a(N)
A[1]:= 1: S:= {0, 1}: count:= 1:
v:= 1:
for n from 2 while count < N do
v:= floor(v/2);
if member(v, S) then v:= 2*n fi;
if v <= N then count:= count+1; A[v]:= n fi;
S:= S union {v};
od:
seq(A[i], i=1..N); # Robert Israel, Feb 09 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Name changed by Robert Israel, Feb 09 2020
STATUS
approved