query: Find a general formula for $c_{n+1}=c_n+\frac1{c_n}$ (Recursive)
positive_passages.docid: 22077
positive_passages.text: Closed form for the sequence defined by $a_0=1$ and $a_{n+1} = a_n + a_n^{-1}$
negative_passages.docid: 112948
negative_passages.text: Fibonacci addition law $F_{n+m} = F_{n-1}F_m + F_n F_{m+1}$
negative_passages.docid: 99420
negative_passages.text: Compute $\sum_{n=1}^\infty \frac{1}{(n+1)\sqrt[]{n}+n\sqrt[]{n+1}}$
negative_passages.docid: 19790
negative_passages.text: How to deal with recursion formula in Mathematica?
negative_passages.docid: 64329
negative_passages.text: Limit of the recursive sequence $a_{n+1} = \frac{1}{2}(a_n + \frac{p}{a_n})$
negative_passages.docid: 129860
negative_passages.text: Find a formula for this sequence (and prove it).
negative_passages.docid: 81052
negative_passages.text: Determining a limit of parametrized, recursively defined sequence $a_{n+1}=1+\frac{(a_n-1)^2}{17}$
negative_passages.docid: 97656
negative_passages.text: Finding $a_n$ if $a_0=a_1=1,a_{n+1}=n(a_n+a_{n-1})\ \ (n\ge 1).$
negative_passages.docid: 61592
negative_passages.text: Exponential generating function to find recurrence formula $a_n$
negative_passages.docid: 92235
negative_passages.text: Explicit formula for Bernoulli numbers by using only the recurrence relation
negative_passages.docid: 122096
negative_passages.text: Find $GCD(n^2+1,n+1)$
negative_passages.docid: 126105
negative_passages.text: Compute $\sum_{k=1}^{n} \frac 1 {k(k + 1)} $
negative_passages.docid: 65648
negative_passages.text: Different ways to come up with $1+2+3+\cdots +n=\frac{n(n+1)}{2}$
negative_passages.docid: 23093
negative_passages.text: Proof of recursion formula for Stirling number of the second kind
negative_passages.docid: 124135
negative_passages.text: A general formula for $\sum (k-1)(k-2)(k-3)$?
negative_passages.docid: 107098
negative_passages.text: Find an explicit formula for the recurrence $a_n = n(a_{n-1} + a_{n-2})$ knowing that $ a_0=1$ and $a_1=2$.
negative_passages.docid: 144260
negative_passages.text: Solve recurrence relation $a_n = 3 a_{n - 3} + a_{n-1} + 2 n$