New posts in recurrence-relations

Recurrence telescoping $T(n) = T(n-1) + 1/n$ and $T(n) = T(n-1) + \log n$

Alternate proof that for every natural number $n,\ \left\lfloor\left(\frac{7+\sqrt{37}}{2}\right)^n\right\rfloor$ is divisible by $3$

Notation involving recursive function

What is the closed form of the $f$ with $f(1)=1$, $f(2)=7$ and $f(n)=7f(n-1)-12f(n-2)$ ($n\ge 3$)?

Why $a_{n+3}=a_{n+2}+2a_{n+1}-a_n$ for $n\geq8$, where $a_{n+1}$ is the second smallest number that is not the sum of any earlier terms?

explicit recurrence formula

Find $\inf$ and $\sup$ of $a_n = \frac{a_{n-1} + a_{n-2}}{a_{n-3}}$

Given the recurrence $T_n = 2T_{n-1} - T_{n-2}$, prove by Induction that $T_n = n$

Bounds (and range) of a nonlinear difference equation

Solving non-homogeneous recurrence relations [closed]

Chain rule for discrete/finite calculus

Characteristic equation of a recurrence relation

Finding an Explicit Formula from the Recurrence: $na_{n}= 2 ( a_{n-1}+a_{n-2})$

Find all function satisfying $f(f(n))+f(n)=2n+3k$

Is there a closed form for the polynomials satisfying this recurrence relation?

Concrete Mathematics - The Josephus Problem

Recurrence relation for the integral, $ I_n=\int\frac{dx}{(1+x^2)^n} $

LambertW(k)/k by tetration for natural numbers.

Prove that the sequence with $T(0)=1$ and $T(n) = 1 + \sum_{j=0}^{n-1}T(j)$ is given by $T(n)=2^n$ [duplicate]

A functional recursion problem..do you have any idea?