Closed form for $K(n)=[0;overline{1,2,3,…,n}]$











up vote
4
down vote

favorite
2












I just started playing around with fairly simple periodic continued fractions, and I have a question. The fractions can be represented "linearly": for $ninBbb N$,
$$K(n)=[0;overline{1,2,3,...,n}]$$
I am seeking for a closed form for $K(n)$. I found the first few.



$n=1$:
$$K(1)=frac1{1+K(1)}$$
$$Rightarrow K(1)=frac{-1pmsqrt{5}}2$$
$n=2$:
$$K(2)=frac1{1+frac1{2+K(2)}}$$
$$Rightarrow K(2)=-1pmsqrt{3}$$
$n=3$:
$$K(3)=frac1{1+frac1{2+frac1{3+K(3)}}}$$
$$Rightarrow K(3)=frac{-4pmsqrt{37}}3$$
$n=4$:
$$K(4)=frac1{1+frac1{2+frac1{3+frac1{4+K(4)}}}}$$
$$Rightarrow K(4)=frac{-9pm2sqrt{39}}5$$
As you may be able to tell, these results are all found by simplifying the fraction until one has a quadratic in $K(n)$, at which point the quadratic formula may be applied.



I would be surprised if there wasn't a closed form expression for $K(n)$, as they can all be found the same way. I've failed to recognize any numerical patterns in the results, however.



So, I have two questions:



$1)$: How does one express $K(n)$ in the $operatorname{K}_{i=i_1}^infty frac{a_i}{b_i}$ notation? I was thinking something like
$$K(n)=operatorname{K}_{igeq0}frac1{1+operatorname{mod}(i,n)}$$
$2)$: What is a closed form for $K(n)$?



Thanks.



Update:



I'm pretty sure that all the $pm$ signs in the beginning of the question should be changed to a $+$ sign.










share|cite|improve this question
























  • An infinite continued fraction (as these are) has a unique value, so there really isn't a $pm$ involved in the closed forms. Have you worked out those signs for the first few?
    – coffeemath
    2 days ago










  • @coffeemath well, obviously, the fractions should all have positive values...
    – Connor Harris
    2 days ago






  • 1




    Have you tried looking at the coefficients in the functions $frac{1}{1+frac{1}{2+ddots frac{1}{n+x}}}$ that are involved to see if there are any patterns there? (Otherwise, it might turn out that the coefficients are just described by a recurrence relation without a nice known closed form solution.)
    – Daniel Schepler
    2 days ago






  • 2




    Using this, you should be able to prove the coefficients involved in the equation are related to A001040 and A001053. Their values do not seem to have a simple closed form, but they can be expressed using hypergeometric functions.
    – Jean-Claude Arbaut
    2 days ago






  • 1




    @clathratus Yes, in the few low cases I did, one choice led to a negative. In general they should be positive and less than $1.$
    – coffeemath
    2 days ago















up vote
4
down vote

favorite
2












I just started playing around with fairly simple periodic continued fractions, and I have a question. The fractions can be represented "linearly": for $ninBbb N$,
$$K(n)=[0;overline{1,2,3,...,n}]$$
I am seeking for a closed form for $K(n)$. I found the first few.



$n=1$:
$$K(1)=frac1{1+K(1)}$$
$$Rightarrow K(1)=frac{-1pmsqrt{5}}2$$
$n=2$:
$$K(2)=frac1{1+frac1{2+K(2)}}$$
$$Rightarrow K(2)=-1pmsqrt{3}$$
$n=3$:
$$K(3)=frac1{1+frac1{2+frac1{3+K(3)}}}$$
$$Rightarrow K(3)=frac{-4pmsqrt{37}}3$$
$n=4$:
$$K(4)=frac1{1+frac1{2+frac1{3+frac1{4+K(4)}}}}$$
$$Rightarrow K(4)=frac{-9pm2sqrt{39}}5$$
As you may be able to tell, these results are all found by simplifying the fraction until one has a quadratic in $K(n)$, at which point the quadratic formula may be applied.



I would be surprised if there wasn't a closed form expression for $K(n)$, as they can all be found the same way. I've failed to recognize any numerical patterns in the results, however.



So, I have two questions:



$1)$: How does one express $K(n)$ in the $operatorname{K}_{i=i_1}^infty frac{a_i}{b_i}$ notation? I was thinking something like
$$K(n)=operatorname{K}_{igeq0}frac1{1+operatorname{mod}(i,n)}$$
$2)$: What is a closed form for $K(n)$?



Thanks.



Update:



I'm pretty sure that all the $pm$ signs in the beginning of the question should be changed to a $+$ sign.










share|cite|improve this question
























  • An infinite continued fraction (as these are) has a unique value, so there really isn't a $pm$ involved in the closed forms. Have you worked out those signs for the first few?
    – coffeemath
    2 days ago










  • @coffeemath well, obviously, the fractions should all have positive values...
    – Connor Harris
    2 days ago






  • 1




    Have you tried looking at the coefficients in the functions $frac{1}{1+frac{1}{2+ddots frac{1}{n+x}}}$ that are involved to see if there are any patterns there? (Otherwise, it might turn out that the coefficients are just described by a recurrence relation without a nice known closed form solution.)
    – Daniel Schepler
    2 days ago






  • 2




    Using this, you should be able to prove the coefficients involved in the equation are related to A001040 and A001053. Their values do not seem to have a simple closed form, but they can be expressed using hypergeometric functions.
    – Jean-Claude Arbaut
    2 days ago






  • 1




    @clathratus Yes, in the few low cases I did, one choice led to a negative. In general they should be positive and less than $1.$
    – coffeemath
    2 days ago













up vote
4
down vote

favorite
2









up vote
4
down vote

favorite
2






2





I just started playing around with fairly simple periodic continued fractions, and I have a question. The fractions can be represented "linearly": for $ninBbb N$,
$$K(n)=[0;overline{1,2,3,...,n}]$$
I am seeking for a closed form for $K(n)$. I found the first few.



$n=1$:
$$K(1)=frac1{1+K(1)}$$
$$Rightarrow K(1)=frac{-1pmsqrt{5}}2$$
$n=2$:
$$K(2)=frac1{1+frac1{2+K(2)}}$$
$$Rightarrow K(2)=-1pmsqrt{3}$$
$n=3$:
$$K(3)=frac1{1+frac1{2+frac1{3+K(3)}}}$$
$$Rightarrow K(3)=frac{-4pmsqrt{37}}3$$
$n=4$:
$$K(4)=frac1{1+frac1{2+frac1{3+frac1{4+K(4)}}}}$$
$$Rightarrow K(4)=frac{-9pm2sqrt{39}}5$$
As you may be able to tell, these results are all found by simplifying the fraction until one has a quadratic in $K(n)$, at which point the quadratic formula may be applied.



I would be surprised if there wasn't a closed form expression for $K(n)$, as they can all be found the same way. I've failed to recognize any numerical patterns in the results, however.



So, I have two questions:



$1)$: How does one express $K(n)$ in the $operatorname{K}_{i=i_1}^infty frac{a_i}{b_i}$ notation? I was thinking something like
$$K(n)=operatorname{K}_{igeq0}frac1{1+operatorname{mod}(i,n)}$$
$2)$: What is a closed form for $K(n)$?



Thanks.



Update:



I'm pretty sure that all the $pm$ signs in the beginning of the question should be changed to a $+$ sign.










share|cite|improve this question















I just started playing around with fairly simple periodic continued fractions, and I have a question. The fractions can be represented "linearly": for $ninBbb N$,
$$K(n)=[0;overline{1,2,3,...,n}]$$
I am seeking for a closed form for $K(n)$. I found the first few.



$n=1$:
$$K(1)=frac1{1+K(1)}$$
$$Rightarrow K(1)=frac{-1pmsqrt{5}}2$$
$n=2$:
$$K(2)=frac1{1+frac1{2+K(2)}}$$
$$Rightarrow K(2)=-1pmsqrt{3}$$
$n=3$:
$$K(3)=frac1{1+frac1{2+frac1{3+K(3)}}}$$
$$Rightarrow K(3)=frac{-4pmsqrt{37}}3$$
$n=4$:
$$K(4)=frac1{1+frac1{2+frac1{3+frac1{4+K(4)}}}}$$
$$Rightarrow K(4)=frac{-9pm2sqrt{39}}5$$
As you may be able to tell, these results are all found by simplifying the fraction until one has a quadratic in $K(n)$, at which point the quadratic formula may be applied.



I would be surprised if there wasn't a closed form expression for $K(n)$, as they can all be found the same way. I've failed to recognize any numerical patterns in the results, however.



So, I have two questions:



$1)$: How does one express $K(n)$ in the $operatorname{K}_{i=i_1}^infty frac{a_i}{b_i}$ notation? I was thinking something like
$$K(n)=operatorname{K}_{igeq0}frac1{1+operatorname{mod}(i,n)}$$
$2)$: What is a closed form for $K(n)$?



Thanks.



Update:



I'm pretty sure that all the $pm$ signs in the beginning of the question should be changed to a $+$ sign.







number-theory closed-form continued-fractions






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago

























asked Nov 23 at 22:22









clathratus

2,111220




2,111220












  • An infinite continued fraction (as these are) has a unique value, so there really isn't a $pm$ involved in the closed forms. Have you worked out those signs for the first few?
    – coffeemath
    2 days ago










  • @coffeemath well, obviously, the fractions should all have positive values...
    – Connor Harris
    2 days ago






  • 1




    Have you tried looking at the coefficients in the functions $frac{1}{1+frac{1}{2+ddots frac{1}{n+x}}}$ that are involved to see if there are any patterns there? (Otherwise, it might turn out that the coefficients are just described by a recurrence relation without a nice known closed form solution.)
    – Daniel Schepler
    2 days ago






  • 2




    Using this, you should be able to prove the coefficients involved in the equation are related to A001040 and A001053. Their values do not seem to have a simple closed form, but they can be expressed using hypergeometric functions.
    – Jean-Claude Arbaut
    2 days ago






  • 1




    @clathratus Yes, in the few low cases I did, one choice led to a negative. In general they should be positive and less than $1.$
    – coffeemath
    2 days ago


















  • An infinite continued fraction (as these are) has a unique value, so there really isn't a $pm$ involved in the closed forms. Have you worked out those signs for the first few?
    – coffeemath
    2 days ago










  • @coffeemath well, obviously, the fractions should all have positive values...
    – Connor Harris
    2 days ago






  • 1




    Have you tried looking at the coefficients in the functions $frac{1}{1+frac{1}{2+ddots frac{1}{n+x}}}$ that are involved to see if there are any patterns there? (Otherwise, it might turn out that the coefficients are just described by a recurrence relation without a nice known closed form solution.)
    – Daniel Schepler
    2 days ago






  • 2




    Using this, you should be able to prove the coefficients involved in the equation are related to A001040 and A001053. Their values do not seem to have a simple closed form, but they can be expressed using hypergeometric functions.
    – Jean-Claude Arbaut
    2 days ago






  • 1




    @clathratus Yes, in the few low cases I did, one choice led to a negative. In general they should be positive and less than $1.$
    – coffeemath
    2 days ago
















An infinite continued fraction (as these are) has a unique value, so there really isn't a $pm$ involved in the closed forms. Have you worked out those signs for the first few?
– coffeemath
2 days ago




An infinite continued fraction (as these are) has a unique value, so there really isn't a $pm$ involved in the closed forms. Have you worked out those signs for the first few?
– coffeemath
2 days ago












@coffeemath well, obviously, the fractions should all have positive values...
– Connor Harris
2 days ago




@coffeemath well, obviously, the fractions should all have positive values...
– Connor Harris
2 days ago




1




1




Have you tried looking at the coefficients in the functions $frac{1}{1+frac{1}{2+ddots frac{1}{n+x}}}$ that are involved to see if there are any patterns there? (Otherwise, it might turn out that the coefficients are just described by a recurrence relation without a nice known closed form solution.)
– Daniel Schepler
2 days ago




Have you tried looking at the coefficients in the functions $frac{1}{1+frac{1}{2+ddots frac{1}{n+x}}}$ that are involved to see if there are any patterns there? (Otherwise, it might turn out that the coefficients are just described by a recurrence relation without a nice known closed form solution.)
– Daniel Schepler
2 days ago




2




2




Using this, you should be able to prove the coefficients involved in the equation are related to A001040 and A001053. Their values do not seem to have a simple closed form, but they can be expressed using hypergeometric functions.
– Jean-Claude Arbaut
2 days ago




Using this, you should be able to prove the coefficients involved in the equation are related to A001040 and A001053. Their values do not seem to have a simple closed form, but they can be expressed using hypergeometric functions.
– Jean-Claude Arbaut
2 days ago




1




1




@clathratus Yes, in the few low cases I did, one choice led to a negative. In general they should be positive and less than $1.$
– coffeemath
2 days ago




@clathratus Yes, in the few low cases I did, one choice led to a negative. In general they should be positive and less than $1.$
– coffeemath
2 days ago










1 Answer
1






active

oldest

votes

















up vote
3
down vote



accepted










Following up on Daniel Schepler's comment. Let $$P_n(x) = frac{1}{1 + frac{1}{2 + ddots frac{1}{n+x}}}.$$ This is basically the RHS of the recurrence equation for $K(n)$. Then:
begin{align*}
P_1(x) &= frac{1}{x+1} \
P_2(x) &= frac{x+2}{x+3} \
P_3(x) &= frac{2x+7}{3x+10} \
P_4(x) &= frac{7x+30}{10x+43} \
P_5(x) &= frac{30x+157}{43x+225} \
P_6(x) &= frac{157x+972}{225x+1393}.
end{align*}

Note that $P_n(x) = P_{n-1}left( frac{1}{x+n}right)$. Therefore, if $P_{n-1}(x) = frac{ax+b}{cx+d}$, then
begin{align*}P_n(x) &= frac{frac{a}{x+n} + b}{frac{c}{x+n} + d} \
&= frac{bx + (a+bn)}{dx + (c+dn)}
end{align*}

Thus in general, we may write $$P_n(x) = frac{a_n x + a_{n+1}}{b_n x + b_{n+1}}$$
where $a$ and $b$ satisfy the recurrence $a_{n+1} = a_{n-1} + n a_n$ and likewise for $b$, with the initial conditions $a_1 = 0, a_2 = b_1 = b_2 = 1$. This recurrence gives the OEIS sequences linked by Jean-Claude Arbaut. $K(n)$ is a solution to $x - P_n(x) = 0$, or a root of the quadratic $$b_n x^2 + (b_{n+1} - a_n) x - a_{n+1} = 0.$$






share|cite|improve this answer























  • Is the $a_n=a_{n-1}+na_n$ supposed to be $$a_n=a_{n-1}+na_{n-2}?$$
    – clathratus
    2 days ago










  • Thanks, fixed it
    – Connor Harris
    2 days ago










  • Excellent. Really great answer. Thank you!
    – clathratus
    2 days ago











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',
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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3010921%2fclosed-form-for-kn-0-overline1-2-3-n%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








up vote
3
down vote



accepted










Following up on Daniel Schepler's comment. Let $$P_n(x) = frac{1}{1 + frac{1}{2 + ddots frac{1}{n+x}}}.$$ This is basically the RHS of the recurrence equation for $K(n)$. Then:
begin{align*}
P_1(x) &= frac{1}{x+1} \
P_2(x) &= frac{x+2}{x+3} \
P_3(x) &= frac{2x+7}{3x+10} \
P_4(x) &= frac{7x+30}{10x+43} \
P_5(x) &= frac{30x+157}{43x+225} \
P_6(x) &= frac{157x+972}{225x+1393}.
end{align*}

Note that $P_n(x) = P_{n-1}left( frac{1}{x+n}right)$. Therefore, if $P_{n-1}(x) = frac{ax+b}{cx+d}$, then
begin{align*}P_n(x) &= frac{frac{a}{x+n} + b}{frac{c}{x+n} + d} \
&= frac{bx + (a+bn)}{dx + (c+dn)}
end{align*}

Thus in general, we may write $$P_n(x) = frac{a_n x + a_{n+1}}{b_n x + b_{n+1}}$$
where $a$ and $b$ satisfy the recurrence $a_{n+1} = a_{n-1} + n a_n$ and likewise for $b$, with the initial conditions $a_1 = 0, a_2 = b_1 = b_2 = 1$. This recurrence gives the OEIS sequences linked by Jean-Claude Arbaut. $K(n)$ is a solution to $x - P_n(x) = 0$, or a root of the quadratic $$b_n x^2 + (b_{n+1} - a_n) x - a_{n+1} = 0.$$






share|cite|improve this answer























  • Is the $a_n=a_{n-1}+na_n$ supposed to be $$a_n=a_{n-1}+na_{n-2}?$$
    – clathratus
    2 days ago










  • Thanks, fixed it
    – Connor Harris
    2 days ago










  • Excellent. Really great answer. Thank you!
    – clathratus
    2 days ago















up vote
3
down vote



accepted










Following up on Daniel Schepler's comment. Let $$P_n(x) = frac{1}{1 + frac{1}{2 + ddots frac{1}{n+x}}}.$$ This is basically the RHS of the recurrence equation for $K(n)$. Then:
begin{align*}
P_1(x) &= frac{1}{x+1} \
P_2(x) &= frac{x+2}{x+3} \
P_3(x) &= frac{2x+7}{3x+10} \
P_4(x) &= frac{7x+30}{10x+43} \
P_5(x) &= frac{30x+157}{43x+225} \
P_6(x) &= frac{157x+972}{225x+1393}.
end{align*}

Note that $P_n(x) = P_{n-1}left( frac{1}{x+n}right)$. Therefore, if $P_{n-1}(x) = frac{ax+b}{cx+d}$, then
begin{align*}P_n(x) &= frac{frac{a}{x+n} + b}{frac{c}{x+n} + d} \
&= frac{bx + (a+bn)}{dx + (c+dn)}
end{align*}

Thus in general, we may write $$P_n(x) = frac{a_n x + a_{n+1}}{b_n x + b_{n+1}}$$
where $a$ and $b$ satisfy the recurrence $a_{n+1} = a_{n-1} + n a_n$ and likewise for $b$, with the initial conditions $a_1 = 0, a_2 = b_1 = b_2 = 1$. This recurrence gives the OEIS sequences linked by Jean-Claude Arbaut. $K(n)$ is a solution to $x - P_n(x) = 0$, or a root of the quadratic $$b_n x^2 + (b_{n+1} - a_n) x - a_{n+1} = 0.$$






share|cite|improve this answer























  • Is the $a_n=a_{n-1}+na_n$ supposed to be $$a_n=a_{n-1}+na_{n-2}?$$
    – clathratus
    2 days ago










  • Thanks, fixed it
    – Connor Harris
    2 days ago










  • Excellent. Really great answer. Thank you!
    – clathratus
    2 days ago













up vote
3
down vote



accepted







up vote
3
down vote



accepted






Following up on Daniel Schepler's comment. Let $$P_n(x) = frac{1}{1 + frac{1}{2 + ddots frac{1}{n+x}}}.$$ This is basically the RHS of the recurrence equation for $K(n)$. Then:
begin{align*}
P_1(x) &= frac{1}{x+1} \
P_2(x) &= frac{x+2}{x+3} \
P_3(x) &= frac{2x+7}{3x+10} \
P_4(x) &= frac{7x+30}{10x+43} \
P_5(x) &= frac{30x+157}{43x+225} \
P_6(x) &= frac{157x+972}{225x+1393}.
end{align*}

Note that $P_n(x) = P_{n-1}left( frac{1}{x+n}right)$. Therefore, if $P_{n-1}(x) = frac{ax+b}{cx+d}$, then
begin{align*}P_n(x) &= frac{frac{a}{x+n} + b}{frac{c}{x+n} + d} \
&= frac{bx + (a+bn)}{dx + (c+dn)}
end{align*}

Thus in general, we may write $$P_n(x) = frac{a_n x + a_{n+1}}{b_n x + b_{n+1}}$$
where $a$ and $b$ satisfy the recurrence $a_{n+1} = a_{n-1} + n a_n$ and likewise for $b$, with the initial conditions $a_1 = 0, a_2 = b_1 = b_2 = 1$. This recurrence gives the OEIS sequences linked by Jean-Claude Arbaut. $K(n)$ is a solution to $x - P_n(x) = 0$, or a root of the quadratic $$b_n x^2 + (b_{n+1} - a_n) x - a_{n+1} = 0.$$






share|cite|improve this answer














Following up on Daniel Schepler's comment. Let $$P_n(x) = frac{1}{1 + frac{1}{2 + ddots frac{1}{n+x}}}.$$ This is basically the RHS of the recurrence equation for $K(n)$. Then:
begin{align*}
P_1(x) &= frac{1}{x+1} \
P_2(x) &= frac{x+2}{x+3} \
P_3(x) &= frac{2x+7}{3x+10} \
P_4(x) &= frac{7x+30}{10x+43} \
P_5(x) &= frac{30x+157}{43x+225} \
P_6(x) &= frac{157x+972}{225x+1393}.
end{align*}

Note that $P_n(x) = P_{n-1}left( frac{1}{x+n}right)$. Therefore, if $P_{n-1}(x) = frac{ax+b}{cx+d}$, then
begin{align*}P_n(x) &= frac{frac{a}{x+n} + b}{frac{c}{x+n} + d} \
&= frac{bx + (a+bn)}{dx + (c+dn)}
end{align*}

Thus in general, we may write $$P_n(x) = frac{a_n x + a_{n+1}}{b_n x + b_{n+1}}$$
where $a$ and $b$ satisfy the recurrence $a_{n+1} = a_{n-1} + n a_n$ and likewise for $b$, with the initial conditions $a_1 = 0, a_2 = b_1 = b_2 = 1$. This recurrence gives the OEIS sequences linked by Jean-Claude Arbaut. $K(n)$ is a solution to $x - P_n(x) = 0$, or a root of the quadratic $$b_n x^2 + (b_{n+1} - a_n) x - a_{n+1} = 0.$$







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 2 days ago

























answered 2 days ago









Connor Harris

4,269723




4,269723












  • Is the $a_n=a_{n-1}+na_n$ supposed to be $$a_n=a_{n-1}+na_{n-2}?$$
    – clathratus
    2 days ago










  • Thanks, fixed it
    – Connor Harris
    2 days ago










  • Excellent. Really great answer. Thank you!
    – clathratus
    2 days ago


















  • Is the $a_n=a_{n-1}+na_n$ supposed to be $$a_n=a_{n-1}+na_{n-2}?$$
    – clathratus
    2 days ago










  • Thanks, fixed it
    – Connor Harris
    2 days ago










  • Excellent. Really great answer. Thank you!
    – clathratus
    2 days ago
















Is the $a_n=a_{n-1}+na_n$ supposed to be $$a_n=a_{n-1}+na_{n-2}?$$
– clathratus
2 days ago




Is the $a_n=a_{n-1}+na_n$ supposed to be $$a_n=a_{n-1}+na_{n-2}?$$
– clathratus
2 days ago












Thanks, fixed it
– Connor Harris
2 days ago




Thanks, fixed it
– Connor Harris
2 days ago












Excellent. Really great answer. Thank you!
– clathratus
2 days ago




Excellent. Really great answer. Thank you!
– clathratus
2 days ago


















draft saved

draft discarded




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3010921%2fclosed-form-for-kn-0-overline1-2-3-n%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Berounka

Sphinx de Gizeh

Different font size/position of beamer's navigation symbols template's content depending on regular/plain...