A309832 Maximum length of a binary sequence S such that every pair of subwords of length n in S is of Hamming distance at least 2.
3, 5, 7, 14, 23, 41, 74
Offset: 2
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.