Some Identities for the Palindromes of Even Integers Without 2’s
Received:March 03, 2017  Revised:May 23, 2017
Key Word: palindrome   the Fibonacci number   identity   combinatorial proof  
Fund ProjectL:
Author NameAffiliationE-mail
Yu-hong GUO School of Mathematics and Statistics Hexi University 
Hits: 2221
Download times: 
      In this paper, we study the palindromes of even integers when no 2’s are allowed in both composition and its conjugate composition. And we find the number of these palindromes equal to 2F_n?1 , where, F_n is the n^th Fibonacci number. Consequently, we obtain several identities about the number of these palindromes, the number of compositions into parts equal to 1’s or 2’s, the number of compositions into odd parts and the number of compositions into parts greater than 1.
View Full Text  View/Add Comment  Download reader