Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $G(1) = 0, \ G(2) = 1$, $G(2n+1) = 2 + G(n) + G(n+1)$ and $G(2n) = 1 + G(n), \ \ n \geq 1$

Find $G(n) $

P.S: This is little problem in my problem. I tried to solve by using generating function, but I can not. Can anyone help me. Thanks in advance.

share|cite|improve this question
Please consider accepting answers to your previous questions. You've asked 10 questions so far, almost all of which have been answered. – Bruno Joyal Dec 27 '11 at 9:24
Yeah, I accepted – qwerty89 Dec 27 '11 at 9:28
@qwerty89 By accepting he meant that you click on the tick symbol next to the answer you want to accept. – Rudy the Reindeer Dec 27 '11 at 9:30
@qwerty89 Look here:… – Rudy the Reindeer Dec 27 '11 at 9:43
Thanks, I understood. Anyone can help me solve above problem. Thanks ! – qwerty89 Dec 27 '11 at 9:45

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.