%I #26 May 07 2021 00:59:20
%S 1,2,3,2,4,5,4,6,4,7,6,4,8,9,8,10,8,11,10,8,12,8,13,12,8,14,12,8,15,
%T 14,12,8,16,17,16,18,16,19,18,16,20,16,21,20,16,22,20,16,23,22,20,16,
%U 24,16,25,24,16,26,24,16,27,26,24,16,28,24,16
%N Irregular triangle read by rows: row n gives the sequence of iterations of k - A006519(k), starting with k=n, until 0 is reached.
%C Row n starts with n, then the highest power of 2 dividing n is subtracted to produce the next entry in the row.
%C n first appears at position A000788(n)+1.
%H Peter Kagey, <a href="/A343934/b343934.txt">Rows n = 1..1023, flattened</a>
%e The triangle begins
%e 1
%e 2
%e 3 2
%e 4
%e 5 4
%e 6 4
%e 7 6 4
%t Table[Most @ NestWhileList[# - 2^IntegerExponent[#, 2] &, n, # > 0 &], {n, 1, 30}] // Flatten (* _Amiram Eldar_, May 05 2021 *)
%o (Python)
%o def gen_a():
%o for n in range(1,100):
%o k = n
%o while k>0:
%o yield k
%o k = k & (k-1)
%o a = gen_a()
%Y Cf. A000120 (row widths), A000788, A006519, A129760, A298011 (row sums).
%K nonn,easy,tabf
%O 1,2
%A _Christian Perfect_, May 04 2021