Even and odd compositions with restricted parts
Author:
Preprint
Abstract
A result of Legendre asserts that the difference between the numbers of (length) even and odd partitions of $n$ into distinct parts is $0$, $1$, or $-1$; this also follows from Euler's pentagonal number theorem. We establish an analogous result for compositions and obtain some generalizations that are related to various entries in the On-Line Encyclopedia of Integer Sequences.
Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Legendre Theorems for a Class of Partitions with Initial RepetitionsAnnals of Combinatorics, 2024
- On parity and recurrences for certain partition functionsContributions to Discrete Mathematics, 2020
- A Tableau Approach to the Representation Theory of 0-Hecke AlgebrasAnnals of Combinatorics, 2016
- Partitions with initial repetitionsActa Mathematica Sinica, English Series, 2009