scientific article; zbMATH DE number 3989432
For each pair of positive integers m, n, if d(n) denotes the number of positive divisors of n, \(p_ m(n)\) denotes the number of partitions of n into parts not exceeding m, then \(\sum^{\infty}_{n=1}x^ n/(1-x^ n)=\sum^{\infty}_{n=1}d(n)x^ n\) and \(\prod^{m}_{j=1}(1-x^ j)^{-1}=1+\sum^{\infty}_{n=1}p_ m(n)x^ n.\) The following result is proved. For each positive integer n, \[ d(n)=\sum_{k=1}(-1)^{k- 1}\quad [d(n-k(3k-1)/2)+d(n-k(3k+1)/2)]+\sum_{m=1}(-1)^{m-1}\quad m p_ m(n-m(m+1)/2)\quad, \] where in the sum indexed by k summation extends as far as the arguments of d remain positive and in that indexed by m as far as arguments of \(p_ m\) remain nonnegative.
- How often is the number of divisors of n a divisor of n ?
- On representations by determinants of p(n) and \(p_ m(n)\)
- A combinatorial proof of a recursive formula for multipartitions
- Divisor functions and pentagonal numbers
- On Uchimura’s Connection between Partitions and the Number of Divisors
- On the number of divisors of a number and their sum
- A Relation Between Partitions and the Number of Divisors
- On divisor partitions
- Divisor functions and the number of sum systems
- Additive evaluations of the number of divisors
- Glaisher's divisors and infinite products
- Recursively divisible numbers
- Combinatorial interpretations of a recent convolution for the number of divisors of a positive integer
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752451)