query: Help with a recurrence with even and odd terms
positive_passages.docid: 43327
positive_passages.text: convoluted recurrence: $f(2n)=f(n)+f(n+1)+n, f(2n+1)=f(n)+f(n-1)+1$
negative_passages.docid: 61871
negative_passages.text: Formula for the $n$th term of $1, 2, 2, 3, 3, 3, 4, 4 ,4, 4, 5, ...$
negative_passages.docid: 126214
negative_passages.text: Multiplying Binomial Terms
negative_passages.docid: 121167
negative_passages.text: explicit formula for recurrence relation $a_{n+1}=2a_n+\frac{1}{a_n}$
negative_passages.docid: 83837
negative_passages.text: Odd/Even Permutations
negative_passages.docid: 12648
negative_passages.text: Did I correctly derive this recurrence equation formula
negative_passages.docid: 145255
negative_passages.text: Fibonacci, tribonacci and other similar sequences
negative_passages.docid: 36413
negative_passages.text: Recurrence relation (linear, second-order, constant coefficients)
negative_passages.docid: 58144
negative_passages.text: Solve the recurrence relation:$ T(n) = \sqrt{n} T \left(\sqrt n \right) + n$
negative_passages.docid: 72065
negative_passages.text: What is the best way to solve discrete divide and conquer recurrences?
negative_passages.docid: 100048
negative_passages.text: Got stuck in proving monotonic increasing of a recurrence sequence
negative_passages.docid: 1711
negative_passages.text: Quadratic Recurrence : $f(n) = f(n-1) + f(n-2) + f(n-1) f(n-2)$ Solution? How?
negative_passages.docid: 69791
negative_passages.text: How to solve: T(n) = T(n - 1) + n
negative_passages.docid: 31918
negative_passages.text: How do you create an alternating series with the sign being the same twice in a row?
negative_passages.docid: 127848
negative_passages.text: Determine which Fibonacci numbers are even
negative_passages.docid: 19790
negative_passages.text: How to deal with recursion formula in Mathematica?
negative_passages.docid: 2897
negative_passages.text: Recurrence Relations: general process for solving first order