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 A085684 #9 Mar 28 2018 22:03:03 %S A085684 1,1,1,1,1,1,1,1,1,1,1,2,2,2,1,1,2,3,3,2,1,1,2,4,6,4,2,1,1,3,6,9,9,6, %T A085684 3,1,1,3,7,13,15,13,7,3,1,1,3,9,18,24,24,18,9,3,1,1,4,11,24,37,42,37, %U A085684 24,11,4,1 %N A085684 Triangle read by rows: T(n,k), n >= 0, 0 <= k <= n, is size of maximal 1-transposition-correcting code formed using binary vectors of length n and weight k. %H A085684 José Manuel Gómez Soto, Jesús Leaños, Luis Manuel Ríos-Castro, Luis Manuel Rivera, <a href="https://arxiv.org/abs/1711.03682">On an error-correcting code problem</a>, arXiv:1711.03682 [math.CO], 2017. %H A085684 N. J. A. Sloane, <a href="/A265032/a265032.html">Challenge Problems: Independent Sets in Graphs</a> %e A085684 Triangle begins %e A085684 1 %e A085684 1 1 %e A085684 1 1 1 %e A085684 1 1 1 1 %e A085684 1 2 2 2 1 %e A085684 1 2 3 3 2 1 %e A085684 1 2 4 6 4 2 1 %Y A085684 Column k=1 is floor(n/3), column k=2 is A085680, row sums are A057608. %K A085684 nonn,tabl %O A085684 0,12 %A A085684 _N. J. A. Sloane_, Jul 17 2003