Problem concerned with A018819

Vladeta Jovovic vladeta at EUnet.yu
Tue Aug 7 16:37:42 CEST 2007


Let p be a partition of n.

Define Perm(p)  to be the number of permutations on p (if we consider p as a multiset) or equivalently the number of compositions generated by p.

Then, it seems that 

number of partitions p of n such that Perm(p) is odd  =  number of partitions of n into powers of 2  =  A018819(n) .

Is there a (simple bijective) proof of this conjecture?

Best regards,

Vladeta Jovovic
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>

More information about the SeqFan mailing list