All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers > Sequences
Greetings from P (Posted on 2013-01-24) Difficulty: 2 of 5
Derive a formula for the number of partitions of n into parts that are odd and bigger than 1; e.g. a(12)=5 cases: 3+3+3+3, 5+7, 7+5, 3+9, 9+3.

Verify your formula by evaluating a(14).

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): P is for what? Comment 5 of 5 |
(In reply to re: P is for what? by Charlie)

Actually I was referring to the formula given at
which has 3 terms based on the roots of <img src="" class="numberedequation" alt=" x^3+x^2-1=0. " border="0" height="17" width="91">

which reminds me of the closed form given as (6) at
which has two terms based on the roots of <img src="" class="numberedequation" alt=" x^2-x-1=0, " border="0" height="17" width="85">

But you are right there are are other ways of generating Fibonacci numbers that have analogues for Padovan numbers.

  Posted by Jer on 2013-01-25 09:18:28

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information