The Multinomial Combinatorial Convolution Sum
Journal of Advances in Mathematics and Computer Science · pp. 487–494 · Published 16 Nov 2013
10.9734/BJMCS/2014/6730Abstract
In [1] and [3] we can find some formulas of binomial combinatorial convolution sums involving divisor functions. Starting from these formulas, we obtain a multinomial combinatorial convolution sum.
Cited by 0
No indexed citations yet.
Related research
- The Convolution Sums with the Number of Representations of a Positive Integer as Sum of 6 Squares — shares topic coverage
- The Number of Representations of a Positive Integer as a Sum of Four Triangular Numbers — shares topic coverage
- The Product-to-sum Expressing with a Divisor Function σ3(n) — shares topic coverage
- Evaluation of Some Convolution Sums and Representation Numbers of Quadratic Forms of Discriminant -135 — shares topic coverage
- Evaluation of Certain Convolution Sums Involving Divisor Functions and Infinite Product Sums — shares topic coverage
Article metrics
Real usage data collected on this platform.
14
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.