How to find the nth term in the following sequence: 1,1,2,2,4,4,8,8,16,16 The Next CEO of...
How to delete every two lines after 3rd lines in a file contains very large number of lines?
Legal workarounds for testamentary trust perceived as unfair
Are police here, aren't itthey?
How to write a definition with variants?
Why do airplanes bank sharply to the right after air-to-air refueling?
Prepend last line of stdin to entire stdin
What flight has the highest ratio of timezone difference to flight time?
If the heap is zero-initialized for security, then why is the stack merely uninitialized?
Writing differences on a blackboard
If Nick Fury and Coulson already knew about aliens (Kree and Skrull) why did they wait until Thor's appearance to start making weapons?
Poetry, calligrams and TikZ/PStricks challenge
Grabbing quick drinks
Why the difference in type-inference over the as-pattern in two similar function definitions?
Is it ever safe to open a suspicious HTML file (e.g. email attachment)?
Defamation due to breach of confidentiality
Method for adding error messages to a dictionary given a key
Can MTA send mail via a relay without being told so?
Would a grinding machine be a simple and workable propulsion system for an interplanetary spacecraft?
How to count occurrences of text in a file?
Is there a way to save my career from absolute disaster?
Is it professional to write unrelated content in an almost-empty email?
Why specifically branches as firewood on the Altar?
Reference request: Grassmannian and Plucker coordinates in type B, C, D
Why does standard notation not preserve intervals (visually)
How to find the nth term in the following sequence: 1,1,2,2,4,4,8,8,16,16
The Next CEO of Stack OverflowHow to interpret the OEIS function for the “even fractal sequence” A103391 (1, 2, 2, 3, 2, 4, 3, 5, …)What will be nth term of the following sequence?How to find the nth term of this sequence?Number of possible ordered sequencesFind nth term of sequenceHow can i find the decimal values with a list of integers?Given a sequence find nth termFind nth term for below sequenceProve $lim_{ntoinfty}U_{n} = 1$ given $0 lt U_{n} - {1over U_{n}}lt {1over n}$ and $U_n>0$How to find the nth term in quadratic sequence?
$begingroup$
I'm having difficulty in finding the formula for the sequence above, when I put this in wolframalpha it gave me a rather complex formula which I'm not convinced even works properly but I'm sure there's a simple way to achieve this. I've searched for many similar sequences but couldn't find anything that helped me.
I'm thinking I'll most likely need to have a condition for even numbers and another for non even numbers.
Any help would be highly appreciated.
sequences-and-series
New contributor
$endgroup$
add a comment |
$begingroup$
I'm having difficulty in finding the formula for the sequence above, when I put this in wolframalpha it gave me a rather complex formula which I'm not convinced even works properly but I'm sure there's a simple way to achieve this. I've searched for many similar sequences but couldn't find anything that helped me.
I'm thinking I'll most likely need to have a condition for even numbers and another for non even numbers.
Any help would be highly appreciated.
sequences-and-series
New contributor
$endgroup$
1
$begingroup$
How about using the floor function?
$endgroup$
– John. P
16 mins ago
add a comment |
$begingroup$
I'm having difficulty in finding the formula for the sequence above, when I put this in wolframalpha it gave me a rather complex formula which I'm not convinced even works properly but I'm sure there's a simple way to achieve this. I've searched for many similar sequences but couldn't find anything that helped me.
I'm thinking I'll most likely need to have a condition for even numbers and another for non even numbers.
Any help would be highly appreciated.
sequences-and-series
New contributor
$endgroup$
I'm having difficulty in finding the formula for the sequence above, when I put this in wolframalpha it gave me a rather complex formula which I'm not convinced even works properly but I'm sure there's a simple way to achieve this. I've searched for many similar sequences but couldn't find anything that helped me.
I'm thinking I'll most likely need to have a condition for even numbers and another for non even numbers.
Any help would be highly appreciated.
sequences-and-series
sequences-and-series
New contributor
New contributor
New contributor
asked 20 mins ago
AnonymousAnonymous
111
111
New contributor
New contributor
1
$begingroup$
How about using the floor function?
$endgroup$
– John. P
16 mins ago
add a comment |
1
$begingroup$
How about using the floor function?
$endgroup$
– John. P
16 mins ago
1
1
$begingroup$
How about using the floor function?
$endgroup$
– John. P
16 mins ago
$begingroup$
How about using the floor function?
$endgroup$
– John. P
16 mins ago
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
These are just powers of two. So: $2^{lfloor n / 2rfloor}$
$endgroup$
$begingroup$
I'm not sure this works for everything, for example the 6th term should be 4 but 2^(3) = 8
$endgroup$
– Anonymous
3 mins ago
$begingroup$
This is assuming zero-indexing. So the first element is $n=0$. If you want it to be one-indexed then just subtract 1 from n in the formula.
$endgroup$
– Flowers
46 secs ago
add a comment |
$begingroup$
The sequence is the powers of two, each repeated twice. We can encode the latter feature using the quantity $lfloor frac{n}{2} rfloor$, which has values $0, 0, 1, 1, 2, 2, ldots$.
So, the sequence is given (for appropriate indexing) by $$color{#df0000}{boxed{a_n := 2^{lfloor n / 2 rfloor}}} .$$
$endgroup$
add a comment |
$begingroup$
Alternatively, this is an example of a sequence where the $n$th term is a fixed linear combination of the immediately previous terms: We can write it as
$$a_n = 2 a_{n - 2}, qquad a_0 = a_1 = 1.$$
Using the ansatz $a_n = C r^n$ and substituting in the recursion formula gives $C r^n = 2 C r^{n - 2}$. Rearranging and clearing gives the characteristic equation $r^2 - 2 = 0$, whose solutions are $pm sqrt{2}$. So, the general solution is
$$a_n = A (sqrt{2})^n + B(-sqrt{2})^n = (sqrt{2})^n [A + B(-1)^n] .$$
Substituting the initial values $a_0 = a_1 = 1$ gives a linear system in the coefficients $A, B$.
$endgroup$
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: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
});
}
});
Anonymous 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%2fmath.stackexchange.com%2fquestions%2f3169109%2fhow-to-find-the-nth-term-in-the-following-sequence-1-1-2-2-4-4-8-8-16-16%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$
These are just powers of two. So: $2^{lfloor n / 2rfloor}$
$endgroup$
$begingroup$
I'm not sure this works for everything, for example the 6th term should be 4 but 2^(3) = 8
$endgroup$
– Anonymous
3 mins ago
$begingroup$
This is assuming zero-indexing. So the first element is $n=0$. If you want it to be one-indexed then just subtract 1 from n in the formula.
$endgroup$
– Flowers
46 secs ago
add a comment |
$begingroup$
These are just powers of two. So: $2^{lfloor n / 2rfloor}$
$endgroup$
$begingroup$
I'm not sure this works for everything, for example the 6th term should be 4 but 2^(3) = 8
$endgroup$
– Anonymous
3 mins ago
$begingroup$
This is assuming zero-indexing. So the first element is $n=0$. If you want it to be one-indexed then just subtract 1 from n in the formula.
$endgroup$
– Flowers
46 secs ago
add a comment |
$begingroup$
These are just powers of two. So: $2^{lfloor n / 2rfloor}$
$endgroup$
These are just powers of two. So: $2^{lfloor n / 2rfloor}$
answered 16 mins ago
FlowersFlowers
638410
638410
$begingroup$
I'm not sure this works for everything, for example the 6th term should be 4 but 2^(3) = 8
$endgroup$
– Anonymous
3 mins ago
$begingroup$
This is assuming zero-indexing. So the first element is $n=0$. If you want it to be one-indexed then just subtract 1 from n in the formula.
$endgroup$
– Flowers
46 secs ago
add a comment |
$begingroup$
I'm not sure this works for everything, for example the 6th term should be 4 but 2^(3) = 8
$endgroup$
– Anonymous
3 mins ago
$begingroup$
This is assuming zero-indexing. So the first element is $n=0$. If you want it to be one-indexed then just subtract 1 from n in the formula.
$endgroup$
– Flowers
46 secs ago
$begingroup$
I'm not sure this works for everything, for example the 6th term should be 4 but 2^(3) = 8
$endgroup$
– Anonymous
3 mins ago
$begingroup$
I'm not sure this works for everything, for example the 6th term should be 4 but 2^(3) = 8
$endgroup$
– Anonymous
3 mins ago
$begingroup$
This is assuming zero-indexing. So the first element is $n=0$. If you want it to be one-indexed then just subtract 1 from n in the formula.
$endgroup$
– Flowers
46 secs ago
$begingroup$
This is assuming zero-indexing. So the first element is $n=0$. If you want it to be one-indexed then just subtract 1 from n in the formula.
$endgroup$
– Flowers
46 secs ago
add a comment |
$begingroup$
The sequence is the powers of two, each repeated twice. We can encode the latter feature using the quantity $lfloor frac{n}{2} rfloor$, which has values $0, 0, 1, 1, 2, 2, ldots$.
So, the sequence is given (for appropriate indexing) by $$color{#df0000}{boxed{a_n := 2^{lfloor n / 2 rfloor}}} .$$
$endgroup$
add a comment |
$begingroup$
The sequence is the powers of two, each repeated twice. We can encode the latter feature using the quantity $lfloor frac{n}{2} rfloor$, which has values $0, 0, 1, 1, 2, 2, ldots$.
So, the sequence is given (for appropriate indexing) by $$color{#df0000}{boxed{a_n := 2^{lfloor n / 2 rfloor}}} .$$
$endgroup$
add a comment |
$begingroup$
The sequence is the powers of two, each repeated twice. We can encode the latter feature using the quantity $lfloor frac{n}{2} rfloor$, which has values $0, 0, 1, 1, 2, 2, ldots$.
So, the sequence is given (for appropriate indexing) by $$color{#df0000}{boxed{a_n := 2^{lfloor n / 2 rfloor}}} .$$
$endgroup$
The sequence is the powers of two, each repeated twice. We can encode the latter feature using the quantity $lfloor frac{n}{2} rfloor$, which has values $0, 0, 1, 1, 2, 2, ldots$.
So, the sequence is given (for appropriate indexing) by $$color{#df0000}{boxed{a_n := 2^{lfloor n / 2 rfloor}}} .$$
answered 14 mins ago
TravisTravis
63.8k769151
63.8k769151
add a comment |
add a comment |
$begingroup$
Alternatively, this is an example of a sequence where the $n$th term is a fixed linear combination of the immediately previous terms: We can write it as
$$a_n = 2 a_{n - 2}, qquad a_0 = a_1 = 1.$$
Using the ansatz $a_n = C r^n$ and substituting in the recursion formula gives $C r^n = 2 C r^{n - 2}$. Rearranging and clearing gives the characteristic equation $r^2 - 2 = 0$, whose solutions are $pm sqrt{2}$. So, the general solution is
$$a_n = A (sqrt{2})^n + B(-sqrt{2})^n = (sqrt{2})^n [A + B(-1)^n] .$$
Substituting the initial values $a_0 = a_1 = 1$ gives a linear system in the coefficients $A, B$.
$endgroup$
add a comment |
$begingroup$
Alternatively, this is an example of a sequence where the $n$th term is a fixed linear combination of the immediately previous terms: We can write it as
$$a_n = 2 a_{n - 2}, qquad a_0 = a_1 = 1.$$
Using the ansatz $a_n = C r^n$ and substituting in the recursion formula gives $C r^n = 2 C r^{n - 2}$. Rearranging and clearing gives the characteristic equation $r^2 - 2 = 0$, whose solutions are $pm sqrt{2}$. So, the general solution is
$$a_n = A (sqrt{2})^n + B(-sqrt{2})^n = (sqrt{2})^n [A + B(-1)^n] .$$
Substituting the initial values $a_0 = a_1 = 1$ gives a linear system in the coefficients $A, B$.
$endgroup$
add a comment |
$begingroup$
Alternatively, this is an example of a sequence where the $n$th term is a fixed linear combination of the immediately previous terms: We can write it as
$$a_n = 2 a_{n - 2}, qquad a_0 = a_1 = 1.$$
Using the ansatz $a_n = C r^n$ and substituting in the recursion formula gives $C r^n = 2 C r^{n - 2}$. Rearranging and clearing gives the characteristic equation $r^2 - 2 = 0$, whose solutions are $pm sqrt{2}$. So, the general solution is
$$a_n = A (sqrt{2})^n + B(-sqrt{2})^n = (sqrt{2})^n [A + B(-1)^n] .$$
Substituting the initial values $a_0 = a_1 = 1$ gives a linear system in the coefficients $A, B$.
$endgroup$
Alternatively, this is an example of a sequence where the $n$th term is a fixed linear combination of the immediately previous terms: We can write it as
$$a_n = 2 a_{n - 2}, qquad a_0 = a_1 = 1.$$
Using the ansatz $a_n = C r^n$ and substituting in the recursion formula gives $C r^n = 2 C r^{n - 2}$. Rearranging and clearing gives the characteristic equation $r^2 - 2 = 0$, whose solutions are $pm sqrt{2}$. So, the general solution is
$$a_n = A (sqrt{2})^n + B(-sqrt{2})^n = (sqrt{2})^n [A + B(-1)^n] .$$
Substituting the initial values $a_0 = a_1 = 1$ gives a linear system in the coefficients $A, B$.
answered 44 secs ago
TravisTravis
63.8k769151
63.8k769151
add a comment |
add a comment |
Anonymous is a new contributor. Be nice, and check out our Code of Conduct.
Anonymous is a new contributor. Be nice, and check out our Code of Conduct.
Anonymous is a new contributor. Be nice, and check out our Code of Conduct.
Anonymous is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Mathematics 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%2fmath.stackexchange.com%2fquestions%2f3169109%2fhow-to-find-the-nth-term-in-the-following-sequence-1-1-2-2-4-4-8-8-16-16%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
1
$begingroup$
How about using the floor function?
$endgroup$
– John. P
16 mins ago