Computation of -partial fractions.
Set partitions with successions and separations.
-complementing subsets of nonnegative integers.
Labeled factorization of integers.
On the partitions of a number into arithmetic progressions.
Enumeration of partitions by long rises, levels, and descents.
Expansions of binary recurrences in the additive base formed by the number of divisors of the factorial
We note that every positive integer N has a representation as a sum of distinct members of the sequence , where d(m) is the number of divisors of m. When N is a member of a binary recurrence satisfying some mild technical conditions, we show that the number of such summands tends to infinity with n at a rate of at least c₁logn/loglogn for some positive constant c₁. We also compute all the Fibonacci numbers of the form d(m!) and d(m₁!) + d(m₂)! for some positive integers m,m₁,m₂.
Some Parity Statistics in Integer Partitions
We study integer partitions with respect to the classical word statistics of levels and descents subject to prescribed parity conditions. For instance, a partition with summands may be enumerated according to descents while tracking the individual parities of and . There are two types of parity levels, E = E and O = O, and four types of parity-descents, E > E, E > O, O > E and O > O, where E and O represent arbitrary even and odd summands. We obtain functional equations and explicit...
Page 1