paper

A short proof of the Almkvist-Meurman theorem

arXiv:2310.15312

Abstract

We give a short generating function proof of the Almkvist-Meurman theorem: For integers and , define the numbers by . Equivalently, , where is the Bernoulli polynomial. Then is an integer. The proof is related to Postnikov's functional equation for the generating function for intransitive trees.