login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
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
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
2,1
LINKS
Table of n, a(n) for n=2..8.
CROSSREFS
Cf.
A052944
,
A309833
.
Sequence in context:
A024372
A295717
A308591
*
A319784
A346503
A061390
Adjacent sequences:
A309829
A309830
A309831
*
A309833
A309834
A309835
KEYWORD
hard
,
more
,
nonn
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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)