A050129 a(n) is the least k satisfying A050128(k) = n.

1, 3, 9, 2, 6, 15, 8, 4, 20, 5, 12, 27, 14, 7, 32, 17, 37, 19, 40, 10, 22, 11, 24, 51, 26, 13, 56, 29, 61, 31, 64, 16, 34, 71, 36, 18, 76, 39, 81, 163, 42, 21, 44, 91, 46, 23, 48, 99, 50, 25, 104, 53, 109, 55, 112, 28, 58, 119, 60, 30, 124, 63

Offset: 1

Author

Clark Kimberling

Keywords

• nonn

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

Crossrefs

Cf. A050128.

Programs

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

Extensions

Name changed by Robert Israel, Feb 09 2020