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 A358085 #17 Nov 03 2022 10:06:43 %S A358085 1,1,1,2,1,2,3,4,1,2,3,5,4,6,7,8,1,2,3,5,9,4,6,7,10,11,8,12,13,14,15, %T A358085 16,1,2,3,5,9,17,4,6,7,10,11,18,19,8,12,13,14,15,20,22,23,24,16,21,25, %U A358085 26,27,28,29,30,31,32 %N A358085 Inventory of positions ordered by binary lengths of terms, as an irregular table; the first row contains 1, subsequent rows contains the 1-based positions of terms with binary length 1, followed by positions of terms with binary length 2, 3, etc. in prior rows flattened. %C A358085 The n-th row contains A011782(n-1) terms, and is a permutation of 1..A011782(n-1). %H A358085 Rémy Sigrist, <a href="/A358085/b358085.txt">Table of n, a(n) for n = 1..8192</a> %H A358085 Rémy Sigrist, <a href="/A358085/a358085.gp.txt">PARI program</a> %H A358085 Rémy Sigrist, <a href="/A358085/a358085.png">Scatterplot of the first 2^20 terms</a> %e A358085 Table begins: %e A358085 1, %e A358085 1, %e A358085 1, 2, %e A358085 1, 2, 3, 4, %e A358085 1, 2, 3, 5, 4, 6, 7, 8, %e A358085 1, 2, 3, 5, 9, 4, 6, 7, 10, 11, 8, 12, 13, 14, 15, 16, %e A358085 ... %e A358085 For n = 6: %e A358085 - the terms in rows 1..5 are: 1, 1, 1, 2, 1, 2, 3, 4, 1, 2, 3, 5, 4, 6, 7, 8, %e A358085 - terms with binary length 1 are at positions: 1, 2, 3, 5, 9, %e A358085 - terms with binary length 2 are at positions: 4, 6, 7, 10, 11, %e A358085 - terms with binary length 3 are at positions: 8, 12, 13, 14, 15, %e A358085 - terms with binary length 4 are at positions: 16, %e A358085 - so row 6 is: 1, 2, 3, 5, 9, 4, 6, 7, 10, 11, 8, 12, 13, 14, 15, 16. %o A358085 (PARI) See Links section. %Y A358085 Cf. A011782, A070939, A342585, A356784, A358121. %K A358085 nonn,base,tabf %O A358085 1,4 %A A358085 _Rémy Sigrist_, Oct 30 2022