Partitions of fixed length where certain numbers are disallowed

48 Views Asked by At

I want to know if an elementary Way of counting irreducible trees of order n could be

The number of partitions of 2n-2 of length n with 2 disallowed as a summand? I have only a phone right now, no computer ...