A Rademacher-type exact formula for partitions without sequences
Abstract: In this paper we prove an exact formula for the number of partitions without sequences. By work of Andrews, the corresponding generating function is a product of a modular form and a mock theta function, giving an overall weight of 0. The proof requires evaluating and bounding Kloosterman sums and the Circle Method
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.