This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A343299 #22 May 01 2021 11:24:56
%S A343299 1,2,2,3,4,3,6,4,6,6,7,8,6,10,7,12,7,14,8,13,11,14,12,14,14,15,16,13,
%T A343299 19,14,20,14,22,15,24,14,26,15,28,15,30,16,28,19,29,21,29,23,30,24,29,
%U A343299 27,30,28,30,30,31,32
%N A343299 a(n) = n + A000120(a(n-1)) - a(n-1), with n > 1, a(1) = 1, where A000120(x) is the binary weight of x.
%C A343299 The 'crossings' that appear in the graph seem to occur when a(n) is a power of 2.
%H A343299 Clément Vovard, <a href="/A343299/b343299.txt">Table of n, a(n) for n = 1..10000</a>
%H A343299 Michael De Vlieger, <a href="/A343299/a343299.png">Log-log scatterplot of a(n)</a> for n = 1..2^16.
%H A343299 Michael De Vlieger, <a href="/A343299/a343299_1.png">Log-log scatterplot of a(n)</a> for n = 1..2^10 with color function registering binary weight of a(n-1).
%H A343299 Michael De Vlieger, <a href="/A343299/a343299_2.png">Log-log scatterplot of a(n)</a> for n = 1..2^10 with even n in red and odd n in blue.
%F A343299 a(n) = n - A011371(a(n-1)).
%e A343299 a(2) = 2 + A000120(1) - 1 = 2 + 1 - 1 = 2.
%e A343299 a(6) = 6 + A000120(4) - 4 = 6 + 1 - 4 = 3.
%t A343299 a[1] = 1; a[n_] := a[n] = n + DigitCount[a[n - 1], 2, 1] - a[n - 1]; Array[a, 100] (* _Amiram Eldar_, Apr 12 2021 *)
%o A343299 (PARI) lista(nn) = {my(va = vector(nn)); va[1] = 1; for (n=2, nn, va[n] = n + hammingweight(va[n-1]) - va[n-1];); va;} \\ _Michel Marcus_, Apr 12 2021
%Y A343299 Cf. A000120, A011371
%K A343299 base,look,nonn
%O A343299 1,2
%A A343299 _Clément Vovard_, Apr 11 2021