We consider a natural generalization of h2(n), denoted hm(n), which is the number of partitions of n into parts which are power of m ≥ 2 wherein each power of m is allowed to be used as a part at most m times. In this note, we approach in three different ways using the recurrences, the matrix and the tree to calculate the value of hm(n).
|Number of pages||12|
|Journal||Bulletin of the Korean Mathematical Society|
|Publication status||Published - 2016|
Bibliographical noteFunding Information:
Third author’s research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology (2011-0011257).
© 2016 Korean Mathematical Society.
All Science Journal Classification (ASJC) codes