# Partition of Integer where Part Appears no more than Twice

Jump to navigation
Jump to search

## Theorem

A particular theorem is missing.You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding the theorem.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{TheoremWanted}}` from the code. |

## Proof

This theorem requires a proof.You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{ProofWanted}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |

## Examples

### Partition of $4$ where Part Appears no more than Twice

The integer $4$ can be partitioned such that no part appears more than twice as follows:

- $4$
- $3 + 1$
- $2 + 2$
- $2 + 1 + 1$