Do these recurrence relations have names? Are the term-generating formulas known
Favorites|Homepage
Subscriptions | sitemap
HOME > Mathematics > Do these recurrence relations have names? Are the term-generating formulas known

Do these recurrence relations have names? Are the term-generating formulas known

[From: ] [author: ] [Date: 11-05-10] [Hit: ]
the wikipedia article on it is surprisingly good, in spite of all the criticism that wikipedia gets for shabby research.......
So I know the Fibonacci sequence is defined recursively by: F(n) = F(n-1) + F(n-2). I also know that it has a closed-form definition, Binet's formula.

But what about sequences such as:
F(n) = F(n-1) + F(n-2) + F(n-3)
F(n) = F(n-1) + F(n-2) + F(n-3) + F(n-4)
...
and so on.

Do those have names and/or already-known closed-form solutions? Better yet, would it be possible to derive a general solution for all of the fibonacci-like sequences I'm describing? Such that Binet's formula is a special case of the general formula?

-
http://en.wikipedia.org/wiki/Generalizat…

-
Even so, the wikipedia article on it is surprisingly good, in spite of all the criticism that wikipedia gets for "shabby research".

Report Abuse

1
keywords: these,known,names,Do,term,relations,formulas,generating,have,Are,recurrence,the,Do these recurrence relations have names? Are the term-generating formulas known
New
Hot
© 2008-2010 http://www.science-mathematics.com . Program by zplan cms. Theme by wukong .