Counting Palindromes According to r-Runs
of Ones Using Generating Functions
Department of Mathematics
We derive generating functions for the enumeration of all palindromic
binary strings of length n having only runs of 1's of length
≤ r. We provide asymptotic expressions for fixed r
and n → ∞. Eventually, r is treated as a random
variable and an asymptotic equivalent for the largest run of 1's in
binary palindromes is derived.
Full version: pdf,
Received October 29 2013;
revised version received April 6 2014; April 15 2014.
Published in Journal of Integer Sequences, April 15 2014.
Journal of Integer Sequences home page