Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am trying to solve identity involving binomials and fibbonaci numbers by using generating functions: $$\sum_{k=0}^n{n \choose k}{n+k\choose k}f_{k+1}=\sum_{k=0}^n{n \choose k}{n+k\choose k}(-1)^{n-k}f_{2k+1}$$

My computational approach by Mathematica lead me to derive this generating function:


Can someone show how to transform both or any of the identity sides to obtain (coefficiens of) this generating function.

share|improve this question
I suspect you need to use the shifted Legendre polynomials here $$P_{n}(2x-1) =(-1)^{n}\sum_{k=0}^n{n \choose k}{n+k\choose k}(-x)^{k}.$$ –  Peter Bala Jul 26 '11 at 15:11
:I meant to add that their generating function (the shifted Legendre polynomials) is immediately obtainable from the generating function for the Legendre polynomials (see e.g. the relevant Wikipedia entry). The other ingredient you need will be Binet's formula for the Fibonacci numbers. –  Peter Bala Jul 26 '11 at 15:24
Are you trying to prove the identity using generating functions? Or do you want to compute the coefficients? –  ShreevatsaR Jan 7 at 16:23
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.