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 A098068 #7 May 13 2019 00:40:24 %S A098068 1,1,1,2,1,2,3,4,1,2,2,2,2,3,3,4,4,4,3,4,5,6,7,8 %N A098068 If C is a doubly-even binary code of length N=24m+n, 1 <= n <= 24, then the minimum distance of C^perp is bounded above by 4m+a(n). %C A098068 Coincides with beginning of A066016, although of course that sequence is infinite. %H A098068 E. M. Rains, <a href="https://doi.org/10.1006/ffta.1999.0258">Bounds for self-dual codes over Z_4</a>, Finite Fields Appl. 6 (2000), 146-163. %K A098068 nonn,fini,full %O A098068 1,4 %A A098068 _N. J. A. Sloane_, Sep 13 2004