A309833 Maximum length of a binary sequence S such that any pair of distinct subwords of length n in S is of Hamming distance at least 3.
4, 5, 7, 12, 20, 25, 39, 71
Offset: 3
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.