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 A368804 #23 Jan 09 2024 10:31:25 %S A368804 1,10,11,101,110,1001,1010,1100,111,1011,1101,1110,10011,10101,10110, %T A368804 11001,11010,11100,100011,100101,100110,101001,101010,101100,110001, %U A368804 110010,110100,111000,1111,10111,11011,11101,11110,100111,101011,101101,101110,110011,110101,110110 %N A368804 Irregular triangle read by rows: T(n,k) is the k-th balanced binary word of length 2*n, where words within a row are in lexicographical order (with leading zeros removed and interpreted as decimal numbers). %C A368804 A balanced binary word is composed of the same number of zeros and ones. %C A368804 This is triangle A362030 with terms converted to binary and interpreted as decimal numbers. %H A368804 Paolo Xausa, <a href="/A368804/b368804.txt">Table of n, a(n) for n = 1..17576</a> (rows 1..8 of the triangle, flattened). %e A368804 Triangle begins (where terms in row n are padded with zeros on the left to form a 2*n word): %e A368804 [1] 01 10; %e A368804 [2] 0011 0101 0110 1001 1010 1100; %e A368804 [3] 000111 001011 001101 001110 010011 010101 010110 011001 011010 011100 ... ; %e A368804 ... %t A368804 words[n_]:=Permutations[PadLeft[PadLeft[{},n,1],2n]]; %t A368804 Array[Map[FromDigits,words[#]]&,4] %Y A368804 Cf. A014486, A063171, A362030. %Y A368804 Cf. A368750, A368751, A368752, A368753. %K A368804 nonn,tabf,base,easy %O A368804 1,2 %A A368804 _Paolo Xausa_, Jan 06 2024