Sylvester power and weighted sums on the Frobenius set in arithmetic progression
From MaRDI portal
Publication:2133405
Abstract: Let be positive integers with . Frobenius number is the largest positive integer that is NOT representable in terms of . When , there is no explicit formula in general, but some formulae may exist for special sequences , including, those forming arithmetic progressions and their modifications. In this paper, we give formulae for the power and weighted sum of nonrepresentable positive integers. As applications, we show explicit expressions of these sums for forming arithmetic progressions.
Recommendations
- Weighted Sylvester sums on the Frobenius set
- Weighted Sylvester sums on the Frobenius set in more variables
- The Frobenius problem, sums of powers of integers, and recurrences for the Bernoulli numbers
- scientific article; zbMATH DE number 722338
- General power sums of integers that are, and are not, represented in the two-element Frobenius problem
Cites work
- scientific article; zbMATH DE number 3176160 (Why is no real title available?)
- scientific article; zbMATH DE number 166132 (Why is no real title available?)
- scientific article; zbMATH DE number 722338 (Why is no real title available?)
- scientific article; zbMATH DE number 2051803 (Why is no real title available?)
- scientific article; zbMATH DE number 1507932 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- A Linear Diophantine Problem
- A sum of negative degrees of the gaps values in 2 and 3-generated numerical semigroups
- Alternate Sylvester sums on the Frobenius set
- Formulae for the Frobenius number in three variables
- Note on Linear Forms
- On Sums of Positive Integers That Are Not of the Form ax + by
- On a Problem of Partitions
- On a special case of the Frobenius problem
- On changes in the Frobenius and Sylvester numbers
- On formulas for the Frobenius number of a numerical semigroup.
- On linear forms whose coefficients are in arithmetic progression
- On the linear diophantine problem of Frobenius.
- Power sums related to semigroups \(S(d_1,d_2,d_3)\).
- The Frobenius number of geometric sequences
- The Frobenius problem, sums of powers of integers, and recurrences for the Bernoulli numbers
- The polynomial part of a restricted partition function related to the Frobenius problem
- Weighted Sylvester sums on the Frobenius set in more variables
Cited in
(14)- Alternate Sylvester sums on the Frobenius set
- Weighted Sylvester sums on the Frobenius set
- Sylvester weighted power sums associated with Apostol-Bernoulli polynomials
- On integers nonrepresentable by a generalized arithmetic progression
- scientific article; zbMATH DE number 722338 (Why is no real title available?)
- Power sums related to semigroups \(S(d_1,d_2,d_3)\).
- On the determination of p-Frobenius and related numbers using the p-Apéry set
- The \(p\)-Frobenius problems for the sequence of generalized repunits
- General power sums of integers that are, and are not, represented in the two-element Frobenius problem
- The Frobenius formula for \(A=(a,ha+d,ha+b_2 d, \ldots, ha+b_k d)\)
- \(p\)-numerical semigroups with \(p\)-symmetric properties
- A combinatorial approach to Frobenius numbers of some special sequences
- The Frobenius number associated with the number of representations for sequences of repunits
- Weighted Sylvester sums on the Frobenius set in more variables
This page was built for publication: Sylvester power and weighted sums on the Frobenius set in arithmetic progression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133405)