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

 Greetings from P (Posted on 2013-01-24)
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.)
 not a formula, but here are the first 44 | Comment 1 of 5

DECLARE SUB decompose (x!)
CLEAR , , 25000
DIM SHARED ct
CLS
FOR n = 1 TO 44
ct = 0
decompose n
PRINT n, ct
NEXT n

SUB decompose (x)
IF x < 3 THEN EXIT SUB
FOR addend = 3 TO x STEP 2
ct = ct + 1
ELSE
END IF
NEXT
END SUB

finds

`n         partitions   1             02             03             14             05             16             17             18             29             210            311            412            513            714            915            1216            1617            2118            2819            3720            4921            6522            8623            11424            15125            20026            26527            35128            46529            61630            81631            108132            143233            189734            251335            332936            441037            584238            773939            1025240            1358141            1799142            2383343            3157244            41824`

 Posted by Charlie on 2013-01-24 13:55:44

 Search: Search body:
Forums (0)