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 A335858 #11 Jul 02 2020 02:03:29 %S A335858 0,1,2,3,5,6,4,7,10,13,9,14,11,12,8,15,21,26,18,29,22,25,17,30,20,27, %T A335858 19,28,23,24,16,31,42,53,37,58,45,50,34,61,41,54,38,57,46,49,33,62,43, %U A335858 52,36,59,44,51,35,60,40,55,39,56,47,48,32,63,85,106,74 %N A335858 Nonnegative integers ordered by binary length and then lexicographically by run lengths (considering least significant runs first). %C A335858 The variant where we consider most significant runs first apparently corresponds to A180200. %H A335858 Rémy Sigrist, <a href="/A335858/b335858.txt">Table of n, a(n) for n = 0..8192</a> %H A335858 Rémy Sigrist, <a href="/A335858/a335858.gp.txt">PARI program for A335858</a> %H A335858 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A335858 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A335858 Apparently a(n) = A056539(A180200(n)). %e A335858 The first terms, alongside the corresponding binary representation and run lengths, are: %e A335858 n a(n) bin(a(n)) A227736(n, *) %e A335858 -- ---- --------- ------------- %e A335858 0 0 0 () %e A335858 1 1 1 (1) %e A335858 2 2 10 (1, 1) %e A335858 3 3 11 (2) %e A335858 4 5 101 (1, 1, 1) %e A335858 5 6 110 (1, 2) %e A335858 6 4 100 (2, 1) %e A335858 7 7 111 (3) %e A335858 8 10 1010 (1, 1, 1, 1) %e A335858 9 13 1101 (1, 1, 2) %e A335858 10 9 1001 (1, 2, 1) %e A335858 11 14 1110 (1, 3) %e A335858 12 11 1011 (2, 1, 1) %e A335858 13 12 1100 (2, 2) %e A335858 14 8 1000 (3, 1) %e A335858 15 15 1111 (4) %o A335858 (PARI) See Links section. %Y A335858 Cf. A005811, A180200, A227736. %K A335858 nonn,base %O A335858 0,3 %A A335858 _Rémy Sigrist_, Jun 27 2020