login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
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
4, 5, 7, 12, 20, 25, 39, 71
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
3,1
LINKS
Table of n, a(n) for n=3..10.
CROSSREFS
Cf.
A052944
,
A309832
.
Sequence in context:
A032390
A112918
A138920
*
A048224
A064237
A139373
Adjacent sequences:
A309830
A309831
A309832
*
A309834
A309835
A309836
KEYWORD
nonn
,
more
AUTHOR
Yeow Meng Chee
, Aug 19 2019
STATUS
approved
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 April 27 05:51 EDT 2024. Contains 372009 sequences. (Running on oeis4.)