speciality of the binary sequence $underline{100101100110100}101101001$
$begingroup$
One friend has given me this binary sequence and asked what is its speciality if we add next few terms to this sequence?
The binary sequence was:
$$color{blue}{underline{100101100110100}}101101001 dots$$
Hints Given: It's a Classical one.
So,could anyone please help me to recognise its speciality...
pattern number-sequence
New contributor
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
One friend has given me this binary sequence and asked what is its speciality if we add next few terms to this sequence?
The binary sequence was:
$$color{blue}{underline{100101100110100}}101101001 dots$$
Hints Given: It's a Classical one.
So,could anyone please help me to recognise its speciality...
pattern number-sequence
New contributor
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
One friend has given me this binary sequence and asked what is its speciality if we add next few terms to this sequence?
The binary sequence was:
$$color{blue}{underline{100101100110100}}101101001 dots$$
Hints Given: It's a Classical one.
So,could anyone please help me to recognise its speciality...
pattern number-sequence
New contributor
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
One friend has given me this binary sequence and asked what is its speciality if we add next few terms to this sequence?
The binary sequence was:
$$color{blue}{underline{100101100110100}}101101001 dots$$
Hints Given: It's a Classical one.
So,could anyone please help me to recognise its speciality...
pattern number-sequence
pattern number-sequence
New contributor
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked yesterday
SureshSuresh
1224
1224
New contributor
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Suresh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Is it:
The (opposite of the) Thue-Morse sequence.
Start with $1 to 10 to 1001 to 10010110 to 1001011001101001$, where at each step the opposite of what is already there is added.
$endgroup$
1
$begingroup$
Note for the curious: this is in fact equivalent to gopal's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
It could be
Binary strings that have 1s where 'evil numbers' occur, 0s elsewhere and every term ends >!with the n-th evil number index (counting with 0 = first).
Source-OEIS
$endgroup$
2
$begingroup$
Note for the curious: this is in fact equivalent to JonMark Perry's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
It could be:
Morse code with a 1 as a dot, a 11 as a dash, 0 as a gap between dots and dashes, and 00 as gap between letters.
In which case:
The message becomes "EANRE". Not sure if this is if any note...
$endgroup$
1
$begingroup$
Curiously, Morse is relevant here, but not that Morse.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Suresh is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80335%2fspeciality-of-the-binary-sequence-underline100101100110100101101001%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Is it:
The (opposite of the) Thue-Morse sequence.
Start with $1 to 10 to 1001 to 10010110 to 1001011001101001$, where at each step the opposite of what is already there is added.
$endgroup$
1
$begingroup$
Note for the curious: this is in fact equivalent to gopal's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
Is it:
The (opposite of the) Thue-Morse sequence.
Start with $1 to 10 to 1001 to 10010110 to 1001011001101001$, where at each step the opposite of what is already there is added.
$endgroup$
1
$begingroup$
Note for the curious: this is in fact equivalent to gopal's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
Is it:
The (opposite of the) Thue-Morse sequence.
Start with $1 to 10 to 1001 to 10010110 to 1001011001101001$, where at each step the opposite of what is already there is added.
$endgroup$
Is it:
The (opposite of the) Thue-Morse sequence.
Start with $1 to 10 to 1001 to 10010110 to 1001011001101001$, where at each step the opposite of what is already there is added.
answered yesterday
JonMark PerryJonMark Perry
19.9k64096
19.9k64096
1
$begingroup$
Note for the curious: this is in fact equivalent to gopal's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
1
$begingroup$
Note for the curious: this is in fact equivalent to gopal's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
1
1
$begingroup$
Note for the curious: this is in fact equivalent to gopal's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
$begingroup$
Note for the curious: this is in fact equivalent to gopal's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
It could be
Binary strings that have 1s where 'evil numbers' occur, 0s elsewhere and every term ends >!with the n-th evil number index (counting with 0 = first).
Source-OEIS
$endgroup$
2
$begingroup$
Note for the curious: this is in fact equivalent to JonMark Perry's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
It could be
Binary strings that have 1s where 'evil numbers' occur, 0s elsewhere and every term ends >!with the n-th evil number index (counting with 0 = first).
Source-OEIS
$endgroup$
2
$begingroup$
Note for the curious: this is in fact equivalent to JonMark Perry's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
It could be
Binary strings that have 1s where 'evil numbers' occur, 0s elsewhere and every term ends >!with the n-th evil number index (counting with 0 = first).
Source-OEIS
$endgroup$
It could be
Binary strings that have 1s where 'evil numbers' occur, 0s elsewhere and every term ends >!with the n-th evil number index (counting with 0 = first).
Source-OEIS
answered yesterday
gopalgopal
1363
1363
2
$begingroup$
Note for the curious: this is in fact equivalent to JonMark Perry's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
2
$begingroup$
Note for the curious: this is in fact equivalent to JonMark Perry's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
2
2
$begingroup$
Note for the curious: this is in fact equivalent to JonMark Perry's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
$begingroup$
Note for the curious: this is in fact equivalent to JonMark Perry's answer.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
It could be:
Morse code with a 1 as a dot, a 11 as a dash, 0 as a gap between dots and dashes, and 00 as gap between letters.
In which case:
The message becomes "EANRE". Not sure if this is if any note...
$endgroup$
1
$begingroup$
Curiously, Morse is relevant here, but not that Morse.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
It could be:
Morse code with a 1 as a dot, a 11 as a dash, 0 as a gap between dots and dashes, and 00 as gap between letters.
In which case:
The message becomes "EANRE". Not sure if this is if any note...
$endgroup$
1
$begingroup$
Curiously, Morse is relevant here, but not that Morse.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
$begingroup$
It could be:
Morse code with a 1 as a dot, a 11 as a dash, 0 as a gap between dots and dashes, and 00 as gap between letters.
In which case:
The message becomes "EANRE". Not sure if this is if any note...
$endgroup$
It could be:
Morse code with a 1 as a dot, a 11 as a dash, 0 as a gap between dots and dashes, and 00 as gap between letters.
In which case:
The message becomes "EANRE". Not sure if this is if any note...
answered yesterday
AHKieranAHKieran
5,4261143
5,4261143
1
$begingroup$
Curiously, Morse is relevant here, but not that Morse.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
1
$begingroup$
Curiously, Morse is relevant here, but not that Morse.
$endgroup$
– Gareth McCaughan♦
yesterday
1
1
$begingroup$
Curiously, Morse is relevant here, but not that Morse.
$endgroup$
– Gareth McCaughan♦
yesterday
$begingroup$
Curiously, Morse is relevant here, but not that Morse.
$endgroup$
– Gareth McCaughan♦
yesterday
add a comment |
Suresh is a new contributor. Be nice, and check out our Code of Conduct.
Suresh is a new contributor. Be nice, and check out our Code of Conduct.
Suresh is a new contributor. Be nice, and check out our Code of Conduct.
Suresh is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80335%2fspeciality-of-the-binary-sequence-underline100101100110100101101001%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown