Generating Function with lambda terms

I've been working on a homework problem for an enumeration course that has been giving me fits.

Find a formula for f(n) if $\displaystyle \lambda(i) = \lfloor|sin(5i)|\rfloor\ \forall i \in N$.

$\displaystyle \Lambda (y) = \sum_{k\geq0}\lambda(k)y^k$

$\displaystyle F(x) = \Lambda (F(x))$

$\displaystyle F(x) = \sum_{i\geq0}\lfloor|sin(5i)|\rfloor F^i(x)$

Can anyone explain how I can find a power series representation of F(x) from which I can find f(n)?

Thanks.

Re: Generating Function with lambda terms

Hey schreckenstat.

What is F^i(x) referring to? Are these derivatives of some kind?

Re: Generating Function with lambda terms

Sorry, I probably should've been a bit more descriptive in my first post. $\displaystyle F^i(x)$ would be the function $\displaystyle F(x)$ to the ith power. Generally in these sort of problems you solve for the generating function F(x), and then find a power series representation for F(x) from which you can construct another formula f(n) which would solve a recurrence relation. An easier example might be something like if $\displaystyle \lambda(0)=1\ ,\ \lambda(1)=2\ , \lambda(2)=1$, using the first two formulas in the first post we would have $\displaystyle F(x)=x(1+2F(x)+F^2(x))$. In this case you could use the quadratic equation to find an expression for F(x), and then find a power series representation of F(x) to find f(n). The problem I'm having with this one is that I'm not sure how to attack that sum of sines to find an expression for F(x). Hope that makes things a bit more clear.

Re: Generating Function with lambda terms

I don't think i can help you in this case unfortunately. This is beyond my current set of knowledge at this time.