Jon Perry on Thu, 12 Feb 2004 18:48:19 +0100

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

RE: Partition code


I managed to decode the inner workings of mine to come up with;

P(n) can be defined as the number of words of length n that begin with a 1,
have more or equals 1's to 2's to 3's, etc.., if k is the highest integer
present then 1..k appear, and p_1<=p_2...<=p_k.

e.g. for 5 we have 11111,11112,11122,11123,11223,11234,12345.

Jon Perry
BrainBench MVP for HTML and JavaScript