Papers
Topics
Authors
Recent
Search
2000 character limit reached

A refinement of a result of Andrews and Newman on the sum of minimal excludants

Published 15 Oct 2021 in math.NT and math.CO | (2110.08108v1)

Abstract: We find an interesting refinement of a result due to Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of distinct parts partitions of $n$ into two colors. In addition, we also study $k{th}$ moments of minimal excludants by means of generalizing the aforementioned result. At the end, we also provide an alternate proof of a beautiful identity due to Hopkins, Sellers and Stanton.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.