Take the 2-minute tour ×

Fibonacci numbers are defined by the recurrence relation $f_{n+2}=f_{n+1}+f_{n}$ and Tribonacci numbers by $f_{n+3}=f_{n+2}+f_{n+1}+f_{n}$

One can define, in general, K-Bonacci numbers as $f_{n+K}=f_{n+K-1}+...+f_{n+1}+f_{n}$

(they show up naturally if you consider the problem of counting binary strings of length n which do not contain sequences of K adjacent zeroes).

The characteristic polynomial associated to K-Bonacci numbers is $$P_K(t):=t^K-(t^{K-1}+t^{K-2}+...+t+1)$$ By the way, he same polynomial turns up when trying to calculate the asymptotic growth rate via generating functions and, as $K \to +\infty$, the biggest real root approaches 2.

Question: do these polynomials have a already a name?

share|improve this question
If you need to refer to these polynomials, you could call them the "Characteristic polynomials of the K-Bonacci numbers". ;-) –  André Henriques Nov 23 '10 at 19:48

3 Answers 3

up vote 3 down vote accepted

The dominant root of such a polynomial is often referred to as a multinacci number. These numbers are known to be Pisot numbers and, indeed, tend to 2.

share|improve this answer
Your link does not work for me. Looking at your source, it seems you did it the right way, so I'm not sure what could be wrong. –  Will Jagy Nov 23 '10 at 22:25
@Will, I changed it from Wiki to Mathworld. Basically, a Pisot number is an algebraic integer >1 whose other Galois conjugates are less than 1 in modulus. Like the golden ratio, for instance. These numbers play an important role in dynamics, measure theory and tilings. –  Nikita Sidorov Nov 23 '10 at 22:32
That's better. There is a way to get the most convoluted Wikipedia address working as a link, but I'm not very good at it. I also was hoping to work in a comment about multinational conglomerates, but sometimes the words just do not come together. My policy remains that if the joke needs either an explanation or an emoticon it is not worth writing. Irving Kaplansky and I did some work on these, never published. If I can find a good printout I will scan it in. That does not guarantee there is anything unknown in the notes. –  Will Jagy Nov 23 '10 at 23:07
Thanks, Nikita. You could well suggest to have a look at your pages, which seem to be full of interesting stuff (which goes far beyond this question). Strictly speaking the problem of "finding the name" is still unanswered; neverthanless the name was just a mean to find connections to other topics. Bye –  ccarminat Nov 23 '10 at 23:29

A very good reference for this is at Bob Johnson's fibonacci-page the article Fibonacci and matrices Bob deals with the generalization in terms of matrix-representation. [edit] Well, second thought: I realize: don't know whether he introduces a name for it...

share|improve this answer

You could call them the A154990-polynomials, http://oeis.org/A154990

share|improve this answer

Your Answer


