login
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.
1
3, 5, 7, 14, 23, 41, 74
OFFSET
2,1
CROSSREFS
Sequence in context: A024372 A295717 A308591 * A319784 A346503 A061390
KEYWORD
hard,more,nonn
AUTHOR
Yeow Meng Chee, Aug 19 2019
STATUS
approved