Recursive sequences

[Max Alekseyev]

n 2/27/07, Tanya Khovanova <tanyakh at tanyakhovanova.com> wrote:

> Right now I have the following types of sequences there:
>     * a(n) = d * a(n-1) - a(n-2).
>     * a(n) = d * a(n-1) + d * a(n-2).
>     * a(n) = a(n-1) + a(n-2).
>     * a(n) = d * a(n-1) + a(n-2).

All the above are particular cases of Lucas sequence with a lot of
known properties.
See http://mathworld.wolfram.com/LucasSequence.html

Max




>
>Nice work! Do you consider more general second order recurrences:
>a(n) = c_1 * a(n-1) + c_2 * a(n-2)
>and the inhomogenous case:
>a(n) = c_1 * a(n-1) + c_2 * a(n-2) + b(n)?
>

Thank you! I would like to expand my webpage. Unfortunately for me and fortunately for humanity OEIS has too many sequences. :-) For the page I did, I had to check and copy manually more than 1,000 sequences. 

It was somewhat discouraging (or maybe encouraging to become a better programmer) :-).

So, I decided to have a break now. I would expand my page later after I catch up with my other projects. :-)

Best, Tanya


_________________________________________________________________
Need personalized email and website? Look no further. It's easy
with Doteasy $0 Web Hosting! Learn more at www.doteasy.com