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 A075931 #10 Feb 09 2021 11:50:28 %S A075931 0,31,227,252,805,826,966,985,1354,1365,1449,1462,1647,1648,1676,1683, %T A075931 6182,6201,6341,6362,6915,6940,7136,7167,7532,7539,7567,7568,7753, %U A075931 7766,7850,7861,10315,10324,10408,10423,11118,11121,11149,11154 %N A075931 List of codewords in binary lexicode with Hamming distance 5 written as decimal numbers. %H A075931 Rémy Sigrist, <a href="/A075931/b075931.txt">Table of n, a(n) for n = 0..8191</a> %H A075931 J. H. Conway and N. J. A. Sloane, <a href="https://doi.org/10.1109/TIT.1986.1057187">Lexicographic codes: error-correcting codes from game theory</a>, IEEE Transactions on Information Theory, 32:337-348, 1986. %H A075931 Bob Jenkins, <a href="http://burtleburtle.net/bob/math/lexicode.html">Tables of Binary Lexicodes</a> %H A075931 Ari Trachtenberg, <a href="http://ipsit.bu.edu/phdthesis_html/phdthesis_html.html">Error-Correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs</a> %o A075931 (PARI) a=vector(40); n=0; for (k=0, 11154, if (n==0 || vecmin(apply(o -> hammingweight(bitxor(k, o)), a[1..n]))>=5, print1 (a[n++]=k", "))) \\ _Rémy Sigrist_, Feb 09 2021 %Y A075931 Cf. A075928, A075929, A075930, A075932, A075933, A075924, A075926, A075937. %K A075931 nonn,base %O A075931 0,2 %A A075931 Bob Jenkins (bob_jenkins(AT)burtleburtle.net)