Don’t be arbitrary
$begingroup$
What’s the next number in the sequence?
2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 10, ?
P.S
I’m new, so tell me if the question was too hard or too easy.
number-sequence
$endgroup$
add a comment |
$begingroup$
What’s the next number in the sequence?
2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 10, ?
P.S
I’m new, so tell me if the question was too hard or too easy.
number-sequence
$endgroup$
add a comment |
$begingroup$
What’s the next number in the sequence?
2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 10, ?
P.S
I’m new, so tell me if the question was too hard or too easy.
number-sequence
$endgroup$
What’s the next number in the sequence?
2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 10, ?
P.S
I’m new, so tell me if the question was too hard or too easy.
number-sequence
number-sequence
asked Feb 1 at 13:34
Arvasu KulkarniArvasu Kulkarni
573
573
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
How about
5
because
each number in the sequence is the lowest base number where the number of the term (first is 1, second is 2, etc) in that base is a palindrome.
Example:
1 = 1 in base 2
2 = 2 in base 3
3 = 11 in base 2
4 = 11 in base 3
5 = 101 in base 2
6 = 11 in base 5
7 = 111 in base 2
8 = 22 in base 3
9 = 1001 in base 2
10 = 101 in base 3
11 = 11 in base 10
12 = 22 in base 5
Note:
I solved this without OEIS, but OEIS has this sequence as sequence A016026
$endgroup$
$begingroup$
That was fast! Awesome!
$endgroup$
– Arvasu Kulkarni
Feb 1 at 14:48
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
});
}
});
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%2f79172%2fdon-t-be-arbitrary%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
How about
5
because
each number in the sequence is the lowest base number where the number of the term (first is 1, second is 2, etc) in that base is a palindrome.
Example:
1 = 1 in base 2
2 = 2 in base 3
3 = 11 in base 2
4 = 11 in base 3
5 = 101 in base 2
6 = 11 in base 5
7 = 111 in base 2
8 = 22 in base 3
9 = 1001 in base 2
10 = 101 in base 3
11 = 11 in base 10
12 = 22 in base 5
Note:
I solved this without OEIS, but OEIS has this sequence as sequence A016026
$endgroup$
$begingroup$
That was fast! Awesome!
$endgroup$
– Arvasu Kulkarni
Feb 1 at 14:48
add a comment |
$begingroup$
How about
5
because
each number in the sequence is the lowest base number where the number of the term (first is 1, second is 2, etc) in that base is a palindrome.
Example:
1 = 1 in base 2
2 = 2 in base 3
3 = 11 in base 2
4 = 11 in base 3
5 = 101 in base 2
6 = 11 in base 5
7 = 111 in base 2
8 = 22 in base 3
9 = 1001 in base 2
10 = 101 in base 3
11 = 11 in base 10
12 = 22 in base 5
Note:
I solved this without OEIS, but OEIS has this sequence as sequence A016026
$endgroup$
$begingroup$
That was fast! Awesome!
$endgroup$
– Arvasu Kulkarni
Feb 1 at 14:48
add a comment |
$begingroup$
How about
5
because
each number in the sequence is the lowest base number where the number of the term (first is 1, second is 2, etc) in that base is a palindrome.
Example:
1 = 1 in base 2
2 = 2 in base 3
3 = 11 in base 2
4 = 11 in base 3
5 = 101 in base 2
6 = 11 in base 5
7 = 111 in base 2
8 = 22 in base 3
9 = 1001 in base 2
10 = 101 in base 3
11 = 11 in base 10
12 = 22 in base 5
Note:
I solved this without OEIS, but OEIS has this sequence as sequence A016026
$endgroup$
How about
5
because
each number in the sequence is the lowest base number where the number of the term (first is 1, second is 2, etc) in that base is a palindrome.
Example:
1 = 1 in base 2
2 = 2 in base 3
3 = 11 in base 2
4 = 11 in base 3
5 = 101 in base 2
6 = 11 in base 5
7 = 111 in base 2
8 = 22 in base 3
9 = 1001 in base 2
10 = 101 in base 3
11 = 11 in base 10
12 = 22 in base 5
Note:
I solved this without OEIS, but OEIS has this sequence as sequence A016026
answered Feb 1 at 13:38
Excited RaichuExcited Raichu
6,51521166
6,51521166
$begingroup$
That was fast! Awesome!
$endgroup$
– Arvasu Kulkarni
Feb 1 at 14:48
add a comment |
$begingroup$
That was fast! Awesome!
$endgroup$
– Arvasu Kulkarni
Feb 1 at 14:48
$begingroup$
That was fast! Awesome!
$endgroup$
– Arvasu Kulkarni
Feb 1 at 14:48
$begingroup$
That was fast! Awesome!
$endgroup$
– Arvasu Kulkarni
Feb 1 at 14:48
add a comment |
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%2f79172%2fdon-t-be-arbitrary%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