Extreme Palindromes
Combinatorics
2007-05-23 v1
Abstract
A recursively palindromic (RP) word is one that is a palindrome and whose left half-word and right half-word are each RP. Thus ABACABA is, and MADAM is not, an RP word. We count RP words of given length over a finite alphabet and RP compositions of an integer. We use the same method to determine the parity of the Catalan numbers.
Cite
@article{arxiv.math/0611465,
title = {Extreme Palindromes},
author = {Kathy Q. Ji and Herbert S. Wilf},
journal= {arXiv preprint arXiv:math/0611465},
year = {2007}
}