Abstract
A parity palindrome is a finite sequence of positive integers which when reduced modulo 2 reads the same from back to front as front to back. Compositions that are parity palindromes have ‘a surprisingly’ nice enumerating function. It will be proved that the number of such compositions of 2n + 1 and also of 2n is 2 · 3n−1. Further refinements and implications are also explored.
| Original language | English (US) |
|---|---|
| Article number | A85 |
| Journal | Integers |
| Volume | 21 |
| State | Published - 2021 |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory
- Discrete Mathematics and Combinatorics