data/problems/78.yml
---
:id: 78
:name: Coin partitions
:url: https://projecteuler.net/problem=78
:content: |+
Let p(_n_) represent the number of different ways in which _n_ coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.
| OOOOO |
| OOOO O |
| OOO OO |
| OOO O O |
| OO OO O |
| OO O O O |
| O O O O O |
Find the least value of _n_ for which p(_n_) is divisible by one million.