## Generating function: number of ways to represent n as the sum of only odd integers [closed]

What would the generating function be for representing n as the sum of odd integers?

I have

$f(x)=(1 + x + x^3 + x^5 ...)^n$

but I feel that there is a better way to represent it. In the end I need to show that it is the same as the number of ways to represent n as the sum of distinct integers, which has the generating function: $g(x)=(1+x)(1+x^2)...(1+x^n)$

-
This looks like a homework problem. You should think some more about the correct form of f(x). For one thing, it should not depend on n. – Richard Stanley Mar 21 2010 at 20:42
This looks like homework. Please see the [FAQ](mathoverflow.net/faq) for appropriate questions to ask at math overflow, and also better sites to ask your question. For the record, I think you have the wrong generating function $f(x)$. – Tony Huynh Mar 21 2010 at 20:43
ok, thanks. I don't want an answer just a hint. – mechko Mar 21 2010 at 20:48
I'm closing this question per Richard and Tony's comments. Please see mathoverflow.net/faq#whatnot for more explanation and a list of other sites where this question may be a better fit. – Anton Geraschenko Mar 21 2010 at 20:50