Euler ’ s partition theorem and the combinatorics of `-sequences

@inproceedings{Savage2007EulerS,
  title={Euler ’ s partition theorem and the combinatorics of `-sequences},
  author={Carla D. Savage and Ja Yee},
  year={2007}
}
Euler’s partition theorem states that the number of partitions of an integer N into odd parts is equal to the number of partitions of N in which the ratio of successive parts is greater than 1. It was shown by Bousquet-Mélou and Eriksson in [9] that a similar result holds when “odd parts” is replaced by “parts that are sums of successive terms of an… CONTINUE READING