Partitions in which every term but the smallest one is consecutive

2024/03/23 by Gupta, Rajat, Lebowitz-Lockard, Noah
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2403.15677

Abstract

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of consecutive and almost consecutive partitions. We also find an alternate combinatorial interpretation of the number of almost consecutive partitions of a given integer n and an asymptotic formula for this quantity.

Related

• Separable integer partition classes with restrictions on consecutive parts
• Combinatorial Extensions on Andrews and El Bachraoui's Almost-Distinct Partitions
• A theorem about partitioning consecutive numbers
• Combinatorial proofs for partitions with repeated smallest part
• On Zeckendorf Related Partitions Using the Lucas Sequence