Let $α>1$ be an irrational number. We establish asymptotic formulas for the number of partitions of $n$ into summands and distinct summands, chosen from the Beatty sequence $(\lfloorαm\rfloor)_{m\in\mathbb{N}}$. This improves some results of Erdös and Richmond established in 1977.