The Frequency of Summands of a Particular Size in Palindromic Compositions

Phyllis Chinn1, Ralph Grimaldi2, Silvia Heubach3
1Dept. of Mathematics, Humboldt State University, Arcata, CA 95521
2Dept. of Mathematics, Rose-Hulman Institute of Technology Terre Haute, IN 47803-3999
3Dept. of Mathematics, California State University Los Angeles 5151 State University Drive, Los Angeles, CA 90032-8204

Abstract

A composition of a positive integer \(n\) consists of an ordered sequence of positive integers whose sum is \(n\). A palindromic composition is one for which the sequence is the same from left to right as from right to left. This paper shows various ways of generating all palindromic compositions, counts the number of times each integer appears as a summand among all the palindromic compositions of \(n\), and describes several patterns among the numbers generated in the process of enumeration.