Posted by **Vevea Tepou** on Thursday, October 25, 2012 at 8:46pm.

Suppose a0, a1, a2 ,... is a sequence defined recursively as follows:

a1 = 1, a2 = 2, a3 = 3 and ak = ak-1 + ak-2 + ak-3 for all integers k > 3.

Use strong induction to show that an < 2n for all integers n ≥ 1.

## Answer this Question

## Related Questions

- Discrete Math - Calculate R(4) where the recursively defined sequence R is ...
- math - A sequence of polynomials gk(x) is defined recursively as follows. g0(x)=...
- Fibonacci sequence - The Fibonacci sequence a1=1,a2=1,a3=2,a4=3,a5=5,a6=8… is ...
- algebra 2 - A sequence is defined recursively by a1=1,an=(an-1+1)^2. Write the ...
- math - *if it is in parentheses, it is subscripted. the sequence {a(n)} is ...
- Algebra 2 - The sequence a is defined recursively by: a_1 = 6, and a_(i+1) = ...
- math - for all integers a, b, c, If a/b - 2c and a/2b + 3c then a/b and a/c Is ...
- Math, Please Help - 1) Given the arithmetic sequence an = 4 - 3(n - 1), what is ...
- Algebra - 1) Given the arithmetic sequence an = 4 - 3(n - 1), what is the domain...
- Math - 1) Given the arithmetic sequence an = 4 - 3(n - 1), what is the domain ...