login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1

%I #13 Oct 09 2019 09:52:04

%S 4,5,7,12,20,25,39,71

%N 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.

%Y Cf. A052944, A309832.

%K nonn,more

%O 3,1

%A _Yeow Meng Chee_, Aug 19 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 17:27 EDT 2024. Contains 375545 sequences. (Running on oeis4.)