@article{SILLS2012640,
    Abstract = {The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for any desired m. We do this to demonstrate the power of ``rigorous guessing'' as facilitated by the quasi-polynomial ansatz.},
    Author = {Sills, Andrew V. and Zeilberger, Doron},
    File = {Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz) - 1-s2.0-S0196885812000127-main - a.pdf},
    ISSN = {0196-8858},
    Journal = {Advances in Applied Mathematics},
    Keywords = {Integer partitions},
    Number = {5},
    Pages = {640-645},
    Title = {Formul{\ae} for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)},
    URL = {https://www.sciencedirect.com/science/article/pii/S0196885812000127},
    Volume = {48},
    Year = {2012},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0196885812000127},
    bdsk-url-2 = {https://doi.org/10.1016/j.aam.2011.12.003},
    date-added = {2023-02-26 08:14:35 +0100},
    date-modified = {2023-02-26 08:14:35 +0100},
    doi = {10.1016/j.aam.2011.12.003}
}

@article{SILLS2012640, Abstract = {The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for any desired m. We do this to demonstrate the power of ``rigorous guessing'' as facilitated by the quasi-polynomial ansatz.}, Author = {Sills, Andrew V. and Zeilberger, Doron}, File = {Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz) - 1-s2.0-S0196885812000127-main - a.pdf}, ISSN = {0196-8858}, Journal = {Advances in Applied Mathematics}, Keywords = {Integer partitions}, Number = {5}, Pages = {640-645}, Title = {Formul{\ae} for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)}, URL = {https://www.sciencedirect.com/science/article/pii/S0196885812000127}, Volume = {48}, Year = {2012}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0196885812000127}, bdsk-url-2 = {https://doi.org/10.1016/j.aam.2011.12.003}, date-added = {2023-02-26 08:14:35 +0100}, date-modified = {2023-02-26 08:14:35 +0100}, doi = {10.1016/j.aam.2011.12.003} }