The p-Numerical Semigroup of the Triple of Arithmetic Progressions

Abstract

For given positive integers $a_1,a_2,\cdots ,a_k$ with $gcd(a_1,a_2,\cdots ,a_k)=1$, the denumerant $d\left(n\right)=d(n;a_1,a_2,\cdots ,a_k)$ is the number of nonnegative solutions $(x_1,x_2,\cdots ,x_k)$ of the linear equation $a_1{x}_1+a_2{x}_2+\cdots +a_k{x}_k=n$ for a positive integer n. For a given nonnegative integer p, let $S_p=S_p(a_1,a_2,\cdots ,a_k)$ be the set of all nonnegative integer n’s such that $d\left(n\right)>p$. In this paper, by introducing the p-numerical semigroup, where the set ${\mathbb{N}}_0\backslash S_p$ is finite, we give explicit formulas of the p-Frobenius number, which is the maximum of the set ${\mathbb{N}}_0\backslash S_p$, and related values for the triple of arithmetic progressions. The main aim is to determine the elements of the p-Apéry set.

1. Introduction

For integer $k\ge 2$, consider a set of positive integers $A=\{a_1,\cdots ,a_k\}$. Denote by $d\left(n\right)=d(n;a_1,\cdots ,a_k)$ the number of nonnegative solutions $(x_1,x_2,\cdots ,x_k)$ of the linear equation $a_1{x}_1+a_2{x}_2+\cdots +a_k{x}_k=n$ for a positive integer n. Recently, the concept of p-numerical semigroups was introduced together with their symmetric characteristics [1]. $d\left(n\right)$ is often called the denumerant. For a given nonnegative integer p, let $S_p=S_p\left(A\right)$ be the set of all nonnegative integer n’s such that $d\left(n\right)>p$. For the set of nonnegative integers ${\mathbb{N}}_0$, the set ${\mathbb{N}}_0\backslash S_p$ is finite if and only if $gcd(a_1,\cdots ,a_k)=1$. Then, there exists the largest element $g_p\left(A\right)$ in ${\mathbb{N}}_0\backslash S_p$, which is called the p-Frobenius number, and each element is called the gap. For the so-called p-numerical semigroup $S_p\left(A\right)$, the cardinality $n_p\left(A\right)$ and the sum $s_p\left(A\right)$ of ${\mathbb{N}}_0\backslash S_p$ are called the p-Sylvester number (or the p-genus) and the p-Sylvester sum, respectively. When $p=0$, $S=S_0\left(A\right)$ is the original numerical semigroup, and the 0-Frobenius number $g_0\left(A\right)$ is the original Frobenius number $g\left(A\right)$. Finding the Frobenius and related values is the well-known linear Diophantine problem, posed by Sylvester [2] but known as the Frobenius problem, is the problem to determine the Frobenius number $g\left(A\right)$. The Frobenius problem has been also known as the coin exchange problem (or postage stamp problem/chicken McNugget problem), which has a long history and is one of the problems that has attracted many people as well as experts. The genus $g\left(A\right)=g_0\left(A\right)$ is often fundamental in the study of algebraic curves and commutative algebra.

For two variables $A=\{a,b\}$, it is shown that [2,3]

$$g(a,b)=(a-1)(b-1)-1\mathrm{and}n(a,b)=\frac{(a-1)(b-1)}{2}.$$

(1)

An explicit expression of the Sylvester sum $s\left(A\right)=s_0\left(A\right)$ is given by Brown and Shiue [4] for two variables $A=\{a,b\}$ as

$$s(a,b)=\frac{1}{12}(a-1)(b-1)(2ab-a-b-1).$$

(2)

This result is extended in [5] for the power sum of the set of gaps $s^{\left(\mu \right)}\left(A\right)$, defined by

$$s^{\left(\mu \right)}\left(A\right)=\sum _{n\in {\mathbb{N}}_0\backslash S_p\left(A\right)}{n}^{\mu }$$

in the case of $A=\{a,b\}$. However, for three or more variables, it is very complicated to find a general explicit formula for the Frobenius number, Sylvester number, and Sylvester sum. Only for some special cases have explicit formulas been found, including arithmetic, geometric-like, Fibonacci, Mersenne, and triangular (see, e.g., [6] and references therein). The study of semigroups of natural numbers generated by three elements and its applications to algebraic geometry can be seen in [7]. Some inexplicit formulas for the Frobenius number in three variables can be seen in [8].

When $p>0$, the situation becomes even more difficult. For two variables, it is still easy to find explicit formulas of $g_p(a,b)$, $n_p(a,b)$, and $s_p(a,b)$. However, for three or more variables, no explicit formula had been found, but finally, in 2022, we succeeded in obtaining closed formulas for some special cases, including the triplets of triangular numbers [9], repunits [10], Fibonacci [11], and Jacobsthal numbers [12,13].

We are interested in finding any explicit closed formula for $p\ge 0$. In this paper, we give explicit formulas for the triples forming arithmetic progressions $A=\{a,a+d,a+2d\}$, where a and d are positive integers with $gcd(a,d)=1$. The main result is given as follows (Theorem 1). For $0\le p\le ⌊a/2⌋$,

$$\begin{array}{cc}\hfill & g_p(a,a+d,a+2d)=(a+2d)p+⌊\frac{a-2}{2}⌋a+(a-1)d,\hfill \\ \hfill & n_p(a,a+d,a+2d)\hfill \\ \hfill & =\left\{\begin{array}{cc}(2a+2d-1-p)p+\frac{(a-1)(a+2d-1)}{4}\hfill & \mathrm{if}a\mathrm{is}\mathrm{odd};\hfill \\ (2a+2d-1-p)p+\frac{(a-1)(a+2d-1)+1}{4}\hfill & \mathrm{if}a\mathrm{is}\mathrm{even}.\hfill \end{array}\right.\hfill \end{array}$$

We also show their explicit closed formulas for the power sum $s_p^{\left(\mu \right)}(a,a+d,a+2d)$ (Theorem 2) and the weighted sum $s_{\lambda ,p}^{\left(\mu \right)}(a,a+d,a+2d)$, defined by (Theorem 3)

$$s_{\lambda ,p}^{\left(\mu \right)}(a_1,\cdots ,a_k):=\sum _{n\in {\mathbb{N}}_0\backslash S_p(a_1,\cdots ,a_k)}{\lambda }^n{n}^{\mu }.$$

By exploiting the theory developed in this paper, it may be possible to find values in p-numerical semigroups for other special triplets and sequences. Several new advanced results when $p=0$ have been achieved, e.g., in [14,15,16,17,18,19,20,21,22,23,24,25]. Some applications to Pell sequences can be found in [26,27].

2. Preliminaries

We introduce an extension of the Apéry set (see [28]) in order to obtain the formulas for $g_p\left(A\right)$, $n_p\left(A\right)$, and $s_p\left(A\right)$. Without loss of generality, we assume that $a_1=min\left(A\right)$.

Definition 1.

Let p be a nonnegative integer. For a set of positive integers $A=\{a_1,a_2,\cdots ,a_k\}$ with $gcd\left(A\right)=1$ and $a_1=min\left(A\right)$ we denote it as

$${\mathrm{Ap}}_p\left(A\right)={\mathrm{Ap}}_p(a_1,a_2,\cdots ,a_k)=\{m_0^{\left(p\right)},m_1^{\left(p\right)},\cdots ,m_{a_1-1}^{\left(p\right)}\},$$

the p-Apéry set of A, where each $m_i^{\left(p\right)}$ ($1\le i\le a_1$) satisfied the conditions:

$$\left(\mathrm{i}\right)m_i^{\left(p\right)}\equiv i(mod{a}_1),\left(\mathrm{ii}\right)m_i^{\left(p\right)}\in S_p\left(A\right),\left(\mathrm{iii}\right)m_i^{\left(p\right)}-a_1\notin S_p\left(A\right).$$

Note that $m_0^{\left(0\right)}$ is defined to be 0.

It follows that for each p, the set ${\mathrm{Ap}}_p\left(A\right)$ is a complete residue system modulo $a_1$. That is,

$${\mathrm{Ap}}_p\left(A\right)\equiv \{0,1,\cdots ,a_1-1\}(mod{a}_1).$$

By using the elements in ${\mathrm{Ap}}_p\left(A\right)$, the power sum of the elements in ${\mathbb{N}}_0\backslash S_p\left(A\right)$ can be given [29] (see also [30]).

Proposition 1.

Let k, p, and μ be integers with $k\ge 2$, $p\ge 0$, and $\mu \ge 0$. Assume that $gcd\left(A\right)=1$. We have

$$\begin{array}{cc}\hfill s_p^{\left(\mu \right)}\left(A\right)& :=\sum _{n\in {\mathbb{N}}_0\backslash S_p\left(A\right)}{n}^{\mu }\hfill \\ \hfill & =\frac{1}{\mu +1}\sum _{\kappa =0}^{\mu }\left(\genfrac{}{}{0pt}{}{\mu +1}{\kappa }\right)B_{\kappa }{a}_1^{\kappa -1}\sum _{i=0}^{a_1-1}{\left(m_i^{\left(p\right)}\right)}^{\mu +1-\kappa }+\frac{B_{\mu +1}}{\mu +1}(a_1^{\mu +1}-1),\hfill \end{array}$$

where $B_n$ are Bernoulli numbers defined by

$$\frac{x}{e^x-1}=\sum _{n=0}^{\infty }{B}_n\frac{x^n}{n!}.$$

When $\mu =0,1$ in Proposition 1, together with $g_p\left(A\right)$, we have formulas for the p-Frobenius number, the p-Sylvester number, and the p-Sylvester sum.

Lemma 1.

Let k and p be integers with $k\ge 2$ and $p\ge 0$. Assume that $gcd(a_1,a_2,\cdots ,a_k)=1$. We have

$$\begin{array}{cc}\hfill g_p\left(A\right)& =\left(\underset{0\le j\le a_1-1}{max}{m}_j^{\left(p\right)}\right)-a_1,\hfill \end{array}$$

(3)

$$\begin{array}{cc}\hfill n_p\left(A\right)& =\frac{1}{a_1}\sum _{j=0}^{a_1-1}{m}_j^{\left(p\right)}-\frac{a_1-1}{2},\hfill \end{array}$$

(4)

$$\begin{array}{cc}\hfill s_p\left(A\right)& =\frac{1}{2a_1}\sum _{j=0}^{a_1-1}{\left(m_j^{\left(p\right)}\right)}^2-\frac{1}{2}\sum _{j=0}^{a_1-1}{m}_j^{\left(p\right)}+\frac{a_1^2-1}{12}.\hfill \end{array}$$

(5)

Remark 1.

When $p=0$, Formulas (3)–(5) reduce to the formulas by Brauer and Shockley [31], Selmer [32], and Tripathi [33], respectively:

$$\begin{array}{cc}\hfill g\left(A\right)& =\left(\underset{1\le j\le a_1-1}{max}{m}_j\right)-a_1,\hfill \\ \hfill n\left(A\right)& =\frac{1}{a_1}\sum _{j=0}^{a_1-1}{m}_j-\frac{a_1-1}{2},\hfill \\ \hfill s\left(A\right)& =\frac{1}{2a_1}\sum _{j=0}^{a_1-1}{\left(m_j\right)}^2-\frac{1}{2}\sum _{j=0}^{a_1-1}{m}_j+\frac{a_1^2-1}{12},\hfill \end{array}$$

where $m_j=m_j^{\left(0\right)}$ ($1\le j\le a_1-1$) with $m_0=m_0^{\left(0\right)}=0$.

3. The Main Result

In this section, we shall show the main result and give its proof.

Theorem 1.

Let a and d be integers with $a\ge 3$, $d>0$, and $gcd(a,d)=1$. Then, for $0\le p\le ⌊a/2⌋$,

$$\begin{array}{cc}\hfill & g_p(a,a+d,a+2d)=(a+2d)p+⌊\frac{a-2}{2}⌋a+(a-1)d,\hfill \\ \hfill & n_p(a,a+d,a+2d)\hfill \\ \hfill & =\left\{\begin{array}{cc}(2a+2d-1-p)p+\frac{(a-1)(a+2d-1)}{4}\hfill & \mathit{if}a\mathit{is}\mathit{odd};\hfill \\ (2a+2d-1-p)p+\frac{(a-1)(a+2d-1)+1}{4}\hfill & \mathit{if}a\mathit{is}\mathit{even}.\hfill \end{array}\right.\hfill \end{array}$$

Remark 2.

When $p=0$, the formulas reduce to

$$g_0(a,a+d,a+2d)=⌊\frac{a-2}{2}⌋a+(a-1)d$$

and

$$n_0(a,a+d,a+2d)=\left\{\begin{array}{cc}\frac{(a-1)(a+2d-1)}{4}\hfill & \mathit{if}a\mathit{is}\mathit{odd};\hfill \\ \frac{(a-1)(a+2d-1)+1}{4}\hfill & \mathit{if}a\mathit{is}\mathit{even}.\hfill \end{array}\right.$$

respectively, which are [32] ((3.9) and (3.10)) when $k=3$.

Let $r_{x_2,x_3}=(a+d)x_2+(a+2d)x_3$ for nonnegative integers $x_2$ and $x_3$. In the following tables, this is denoted by $(x_2,x_3)$ for simplicity.

When a is odd, as seen in [32] (3.6), ${\mathrm{Ap}}_0\left(A_3\right)$ ($A_3=\{a,a+d,a+2d\}$) as the complete residue system (minimal system) modulo a is given by

Table 1. Complete residue system ${\mathrm{Ap}}_0\left(A_3\right)$ for odd a.

$(0,0)$	$(1,0)$
$(0,1)$	$(1,1)$
⋮	⋮
$(0,\frac{a-3}{2})$	$(1,\frac{a-3}{2})$
$(0,\frac{a-1}{2})$

.

Concerning the complete residue system ${\mathrm{Ap}}_1\left(A_3\right)$, each congruent value modulo a moves up one line to the upper right block. However, only the two values in the top row move to fill the gap below the first block (see

Table 2. Complete residue system ${\mathrm{Ap}}_1\left(A_3\right)$ from ${\mathrm{Ap}}_0\left(A_3\right)$ for odd a.

$(0,0)$	$(1,0)$	$(2,0)$	$(3,0)$
$(0,1)$	$(1,1)$	$(2,1)$	$(3,1)$
⋮	⋮	⋮	⋮
$(0,\frac{a-5}{2})$	$(1,\frac{a-5}{2})$	$(2,\frac{a-5}{2})$	$(3,\frac{a-5}{2})$
$(0,\frac{a-3}{2})$	$(1,\frac{a-3}{2})$	$(2,\frac{a-3}{2})$
$(0,\frac{a-1}{2})$	$(1,\frac{a-1}{2})$
$(0,\frac{a+1}{2})$

). Namely, for $x_2\ge 1$

$$r_{0,x_2}\equiv r_{2,x_2-1},r_{1,x_2}\equiv r_{3,x_2-1}(moda)$$

and

$$r_{0,0}\equiv r_{1,\frac{a-1}{2}},r_{1,0}\equiv r_{0,\frac{a+1}{2}}(moda).$$

Since

$$\begin{array}{cc}\hfill 3(a+d)+(a+2d)x_3& =a+(a+d)+(a+2d)(x_3+1),\hfill \\ \hfill 2(a+d)+(a+2d)x_3& =a+(a+2d)(x_3+1)(x_3\ge 0),\hfill \\ \hfill (a+d)+\frac{a-1}{2}(a+2d)& =\left(\frac{a+1}{2}+d\right)a,\hfill \\ \hfill \frac{a+1}{2}(a+2d)& =\left(\frac{a-1}{2}+d\right)a+(a+d),\hfill \end{array}$$

we can know that each element in ${\mathrm{Ap}}_1\left(A_3\right)$ has exactly two expressions in terms of $(a,a+d,a+2d)$. Note that each element minus a has only one expression which is yielded from the right-hand side, that is,

$$\begin{array}{cc}\hfill & (a+d)+(a+2d)(x_3+1),(a+2d)(x_3+1)(x_3\ge 0),\hfill \\ \hfill & \left(\frac{a-1}{2}+d\right)a,\left(\frac{a-3}{2}+d\right)a+(a+d).\hfill \end{array}$$

Considering the maximal value, it is clear that

$$r_{0,\frac{a+1}{2}}>r_{1,\frac{a-1}{2}}>r_{2,\frac{a-3}{2}}>r_{3,\frac{a-5}{2}}.$$

Concerning the complete residue system ${\mathrm{Ap}}_2\left(A_3\right)$, each congruent value modulo a moves up one line to the upper right block (the third block). However, only the two values in the top row in the second block move to fill the gap below the first block (see

Table 3. Complete residue system ${\mathrm{Ap}}_2\left(A_3\right)$ from ${\mathrm{Ap}}_1\left(A_3\right)$ for odd a.

		$(2,0)$	$(3,0)$	$(4,0)$	$(5,0)$
		$(2,1)$	$(3,1)$	$(4,1)$	$(5,1)$
		⋮	⋮	⋮	⋮
		⋮	⋮	$(4,\frac{a-7}{2})$	$(5,\frac{a-7}{2})$
		$(2,\frac{a-5}{2})$	$(3,\frac{a-5}{2})$	$(4,\frac{a-5}{2})$
		$(2,\frac{a-3}{2})$	$(3,\frac{a-3}{2})$
	$(1,\frac{a-1}{2})$	$(2,\frac{a-1}{2})$
$(0,\frac{a+1}{2})$	$(1,\frac{a+1}{2})$
$(0,\frac{a+3}{2})$

). Namely, for $x_2\ge 1$

$$r_{2,x_2}\equiv r_{4,x_2-1},r_{3,x_2}\equiv r_{5,x_2-1}(moda)$$

and

$$r_{2,0}\equiv r_{1,\frac{a+1}{2}},r_{3,0}\equiv r_{0,\frac{a+3}{2}}(moda).$$

Since

$$\begin{array}{cc}\hfill 5(a+d)+(a+2d)x_3& =a+3(a+d)+(a+2d)(x_3+1)\hfill \\ \hfill & =2a+(a+d)+(a+2d)(x_3+2),\hfill \\ \hfill 4(a+d)+(a+2d)x_3& =a+2(a+d)+(a+2d)(x_3+1)\hfill \\ \hfill & =2a+(a+2d)(x_3+2)(x_3\ge 0),\hfill \\ \hfill 3(a+d)+\frac{a-3}{2}(a+2d)& =a+(a+d)+\frac{a-1}{2}(a+2d)\hfill \\ \hfill & =\left(\frac{a+3}{2}+d\right)a,\hfill \\ \hfill 2(a+d)+\frac{a-1}{2}(a+2d)& =a+\frac{a+1}{2}(a+2d)\hfill \\ \hfill & =\left(\frac{a+1}{2}+d\right)a+(a+d),\hfill \\ \hfill (a+d)+\frac{a+1}{2}(a+2d)& =\left(\frac{a-1}{2}+d\right)a+2(a+d)\hfill \\ \hfill & =\left(\frac{a+1}{2}+d\right)a+(a+2d),\hfill \\ \hfill \frac{a+3}{2}(a+2d)& =\left(\frac{a-3}{2}+d\right)a+3(a+d)\hfill \\ \hfill & =\left(\frac{a-1}{2}+d\right)a+(a+d)+(a+2d),\hfill \end{array}$$

we can know that each element in ${\mathrm{Ap}}_1\left(A_3\right)$ has exactly three expressions in terms of $(a,a+d,a+2d)$. Note that each element minus a has two expressions which are yielded from the right-hand side, that is,

$$\begin{array}{cc}\hfill 3(a+d)+(a+2d)(x_3+1)& =a+(a+d)+(a+2d)(x_3+2),\hfill \\ \hfill 2(a+d)+(a+2d)(x_3+1)& =a+(a+2d)(x_3+2)(x_3\ge 0),\hfill \\ \hfill (a+d)+\frac{a-1}{2}(a+2d)& =\left(\frac{a+1}{2}+d\right)a,\hfill \\ \hfill \frac{a+1}{2}(a+2d)& =\left(\frac{a-1}{2}+d\right)a+(a+d),\hfill \\ \hfill \left(\frac{a-3}{2}+d\right)a+2(a+d)& =\left(\frac{a-1}{2}+d\right)a+(a+2d),\hfill \\ \hfill \left(\frac{a-3}{2}+d-1\right)a+3(a+d)& =\left(\frac{a-3}{2}+d\right)a+(a+d)+(a+2d).\hfill \end{array}$$

Considering the maximal value, it is clear that

$$r_{0,\frac{a+3}{2}}>r_{1,\frac{a+1}{2}}>r_{2,\frac{a-1}{2}}>r_{3,\frac{a-3}{2}}>r_{4,\frac{a-5}{2}}>r_{5,\frac{a-7}{2}}.$$

If this process is continued for $p=3,4,\cdots$, when $p=(a-1)/2$, the state shown in

Table 4. Complete residue system ${\mathrm{Ap}}_p\left(A_3\right)$ for odd a.

$(0,0)$	$(1,0)$	$(2,0)$	$(3,0)$	⋯	⋯	$(a-3,0)$	$(a-2,0)$	$(a-1,0)$
$(0,1)$	$(1,1)$	$(2,1)$	$(3,1)$			$(a-3,1)$	$(a-2,1)$
⋮	⋮	⋮	⋮			$(a-3,2)$
⋮	⋮	⋮	⋮
$(0,\frac{a-3}{2})$	$(1,\frac{a-3}{2})$	$(2,\frac{a-3}{2})$	$(3,\frac{a-3}{2})$
$(0,\frac{a-1}{2})$	$(1,\frac{a-1}{2})$	$(2,\frac{a-1}{2})$
$(0,\frac{a+1}{2})$	$(1,\frac{a+1}{2})$
$(0,\frac{a+3}{2})$			$(3,a-4)$
⋮		$(2,a-3)$
⋮	$(1,a-2)$
$(0,a-1)$

is reached. Here, the shaded cell parts show the elements of ${\mathrm{Ap}}_{\frac{a-1}{2}}\left(A_3\right)$. Elements with the same residues modulo a move in the following positions according to $p=0,1,2,\cdots ,(a-3)/2,(a-1)/2$.

$$\begin{array}{cc}\hfill & (0,0)\to (1,\frac{a-1}{2})\to (3,\frac{a-3}{2})\to \cdots \to (a-4,2)\to (a-2,1)\hfill \\ \hfill & (1,0)\to (0,\frac{a+1}{2})\to (2,\frac{a-1}{2})\to \cdots \to (a-5,3)\to (a-3,2)\hfill \\ \hfill & (0,1)\to (2,0)\to (1,\frac{a+1}{2})\to \cdots \to (a-6,4)\to (a-4,3)\hfill \\ \hfill & (1,1)\to (3,0)\to (0,\frac{a+3}{2})\to \cdots \to (a-7,5)\to (a-5,4)\hfill \\ \hfill & \cdots \hfill \\ \hfill & (0,\frac{a-3}{2})\to (2,\frac{a-5}{2})\to (4,\frac{a-7}{2})\to \cdots \to (a-3,0)\to (1,a-2)\hfill \\ \hfill & (1,\frac{a-3}{2})\to (3,\frac{a-5}{2})\to (5,\frac{a-7}{2})\to \cdots \to (a-2,0)\to (0,a-1)\hfill \\ \hfill & (0,\frac{a-1}{2})\to (2,\frac{a-3}{2})\to (4,\frac{a-5}{2})\to \cdots \to (a-3,1)\to (a-1,0)\hfill \end{array}$$

Indeed, each element $m_j^{\left(\frac{a-1}{2}\right)}$ in ${\mathrm{Ap}}_{\frac{a-1}{2}}\left(A_3\right)$ has exactly $(a+1)/2$ expressions because

$$\begin{array}{cc}\hfill (a-1)(a+2d)& =(d+i)a+(a-2i)(a+d)+(i-1)(a+2d)\hfill \\ \hfill & (1\le i\le \frac{a-1}{2}),\hfill \\ \hfill (a+d)+(a-2)(a+2d)& =(d+i+1)a+(a-2i-1)(a+d)\hfill \\ \hfill & +(i-1)(a+2d)(1\le i\le \frac{a-1}{2}),\hfill \\ \hfill 2(a+d)+(a-3)(a+2d)& =a+(a-2)(a+2d)\hfill \\ \hfill & =(d+i+2)a+(a-2i-2)(a+d)\hfill \\ \hfill & +(i-1)(a+2d)(1\le i\le \frac{a-3}{2}),\hfill \\ \hfill 3(a+d)+(a-4)(a+2d)& =a+(a+d)+(a-3)(a+2d)\hfill \\ \hfill & =(d+i+3)a+(a-2i-3)(a+d)\hfill \\ \hfill & +(i-1)(a+2d)(1\le i\le \frac{a-3}{2}),\hfill \\ \hfill \cdots \\ \hfill (a-3)(a+d)+2(a+2d)& =ia+(a-2i-3)(a+d)+(i+2)(a+2d)\hfill \\ \hfill & (1\le i\le \frac{a-3}{2})\hfill \\ \hfill & =(a+d-2)a+(a+d),\hfill \\ \hfill (a-2)(a+d)+(a+2d)& =ia+(a-2i-2)(a+d)+(i+1)(a+2d)\hfill \\ \hfill & (1\le i\le \frac{a-3}{2})\hfill \\ \hfill & =(a+d-1)a,\hfill \\ \hfill (a-1)(a+d)& =ia+(a-2i-1)(a+d)+i(a+2d)\hfill \\ \hfill & (1\le i\le \frac{a-1}{2}).\hfill \end{array}$$

But any element $m_j^{\left(\frac{a-1}{2}\right)}-a$ has $(a-1)/2$ expressions.

Considering the maximal value, it is clear that

$$r_{0,a-1}>r_{1,a-2}>r_{2,a-3}>r_{3,a-4}>\cdots >r_{a-3,2}>r_{a-2,1}>r_{a-1,0}.$$

However, such a process cannot be continued further than $0\le p\le (a-1)/2$. When $p=(a+1)/2$, the same residue of $r_{a-1,0}$ modulo a comes to the position $(1,a-1)$ and no element comes to the bottom left position $(0,a)$. Thus, after that, the pattern shifts and is complicated, so it becomes difficult to determine where the maximum element of ${\mathrm{Ap}}_p\left(A_3\right)$ is.

Therefore, when a is odd, for $0\le p\le (a-1)/2$,

$$\begin{array}{cc}\hfill g_p(a,a+d,a+2d)& =\left(\frac{a-1}{2}+p\right)(a+2d)-a\hfill \\ \hfill & =(a+2d)p+\frac{a(a-3)+2(a-1)d}{2}.\hfill \end{array}$$

Concerning the number of representations, we need the summation of the elements in ${\mathrm{Ap}}_p\left(A_3\right)$. The elements in the staircase are

$$\begin{array}{c}\left(0,\frac{a-1}{2}+p\right),\left(1,\frac{a-1}{2}+p-1\right),\cdots ,\hfill \\ \hfill \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\left(2p-2,\frac{a-1}{2}-p+2\right),\left(2p-1,\frac{a-1}{2}-p+1\right),\end{array}$$

and the elements in the large block are

$$(2p,0),\cdots ,\left(2p,\frac{a-1}{2}-p\right),(2p+1,0),\cdots ,\left(2p+1,\frac{a-1}{2}-p-1\right).$$

Hence,

$$\begin{array}{cc}\hfill & \sum _{j=0}^{a-1}{m}_j^{\left(p\right)}\hfill \\ \hfill & =\left(0+1+\cdots +(2p-1)\right)(a+d)\hfill \\ \hfill & +\left(\left(\frac{a-1}{2}-p+1\right)+\left(\frac{a-1}{2}-p+2\right)+\cdots +\left(\frac{a-1}{2}+p\right)\right)(a+2d)\hfill \\ \hfill & +2p\left(\frac{a+1}{2}-p\right)(a+d)+\left(0+1+\cdots +\left(\frac{a-1}{2}-p\right)\right)(a+2d)\hfill \\ \hfill & +(2p+1)\left(\frac{a+1}{2}-p-1\right)(a+d)\hfill \\ \hfill & +\left(0+1+\cdots +\left(\frac{a-1}{2}-p-1\right)\right)(a+2d)\hfill \\ \hfill & =\frac{(2p-1)\left(2p\right)}{2}(a+d)\hfill \\ \hfill & +\left(\frac{(a-1+2p)(a+1+2p)}{8}-\frac{(a-1-2p)(a+1-2p)}{8}\right)(a+2d)\hfill \\ \hfill & +p(a+1-2p)(a+d)+\frac{(a-1-2p)(a+1-2p)}{8}(a+2d)\hfill \\ \hfill & +\frac{2p+1}{2}(a-2p-1)(a+d)+\frac{(a-3-2p)(a-1-2p)}{8}(a+2d)\hfill \\ \hfill & =\frac{a}{4}\left({(a+d)}^2-{(d+1)}^2-4p^2+4(2a+2d-1)p\right).\hfill \end{array}$$

(6)

Hence, by Lemma 1 (4)

$$\begin{array}{cc}\hfill & n_p(a,a+d,a+2d)\hfill \\ \hfill & =\frac{1}{4}\left({(a+d)}^2-{(d+1)}^2-4p^2+4(2a+2d-1)p\right)-\frac{a-1}{2}\hfill \\ \hfill & =\frac{(a-1)(a+2d-1)}{4}-p^2+(2a+2d-1)p.\hfill \end{array}$$

When a is even, ${\mathrm{Ap}}_0\left(A_3\right)$ ($A_3=\{a,a+d,a+2d\}$) is given by

Table 5. Complete residue system ${\mathrm{Ap}}_0\left(A_3\right)$ for even a.

$(0,0)$	$(1,0)$
$(0,1)$	$(1,1)$
⋮	⋮
$(0,\frac{a}{2}-1)$	$(1,\frac{a}{2}-1)$

.

Each congruent value modulo a moves up one line to the upper right block. However, only the two values in the top row move to fill the gap below the first block. Namely, for $x_2\ge 1$

$$r_{0,x_2}\equiv r_{2,x_2-1},r_{1,x_2}\equiv r_{3,x_2-1}(moda)$$

and

$$r_{0,0}\equiv r_{0,\frac{a}{2}},r_{1,0}\equiv r_{1,\frac{a}{2}}(moda).$$

When the process is continued for $p=1,2,\cdots ,a/2$, the state shown in

Table 6. Complete residue system ${\mathrm{Ap}}_{\frac{a}{2}}\left(A_3\right)$ for even a.

$(0,0)$	$(1,0)$	$(2,0)$	$(3,0)$	$(4,0)$	$(5,0)$	⋯	⋯	$(a-4,0)$	$(a-3,0)$	$(a-2,0)$	$(a-1,0)$
$(0,1)$	$(1,1)$	$(2,1)$	$(3,1)$	$(4,1)$	$(5,1)$			$(a-4,1)$	$(a-3,1)$	$(a-2,1)$	$(a-1,1)$
⋮		⋮		⋮				$(a-4,2)$	$(a-3,2)$
⋮		$(2,\frac{a}{2}-3)$	$(3,\frac{a}{2}-3)$	$(4,\frac{a}{2}-3)$	$(5,\frac{a}{2}-3)$			$(a-4,3)$	$(a-3,3)$
$(0,\frac{a}{2}-2)$	$(1,\frac{a}{2}-2)$	$(2,\frac{a}{2}-2)$	$(3,\frac{a}{2}-2)$
$(0,\frac{a}{2}-1)$	$(1,\frac{a}{2}-1)$	$(2,\frac{a}{2}-1)$	$(3,\frac{a}{2}-1)$
$(0,\frac{a}{2})$	$(1,\frac{a}{2})$
$(0,\frac{a}{2}+1)$	$(1,\frac{a}{2}+1)$
⋮
⋮		$(2,a-5)$	$(3,a-5)$	$(4,a-5)$	$(5,a-5)$
⋮		$(2,a-4)$	$(3,a-4)$
$(0,a-3)$	$(1,a-3)$	$(2,a-3)$	$(3,a-3)$
$(0,a-2)$	$(1,a-2)$
$(0,a-1)$	$(1,a-1)$

is reached. Here, the shaded cell parts show the elements of ${\mathrm{Ap}}_{\frac{a}{2}}\left(A_3\right)$. Elements with the same residues modulo a move in the following positions according to $p=0,1,2,\cdots ,a/2-1,a/2$.

$$\begin{array}{cc}\hfill & (0,0)\to (1,\frac{a}{2})\to (2,\frac{a}{2}-1)\to \cdots \to (a-4,2)\to (a-2,1)\hfill \\ \hfill & (1,0)\to (1,\frac{a}{2})\to (3,\frac{a}{2}-1)\to \cdots \to (a-3,2)\to (a-1,1)\hfill \\ \hfill & (0,1)\to (2,0)\to (0,\frac{a}{2}+1)\to \cdots \to (a-6,4)\to (a-4,3)\hfill \\ \hfill & (1,1)\to (3,0)\to (1,\frac{a}{2}+1)\to \cdots \to (a-5,4)\to (a-3,3)\hfill \\ \hfill & \cdots \hfill \\ \hfill & (0,\frac{a}{2}-1)\to (2,\frac{a}{2}-2)\to (4,\frac{a}{2}-3)\to \cdots \to (a-2,0)\to (0,a-1)\hfill \\ \hfill & (1,\frac{a}{2}-1)\to (3,\frac{a}{2}-2)\to (5,\frac{a}{2}-3)\to \cdots \to (a-1,0)\to (1,a-1)\hfill \end{array}$$

Each element $m_j^{\left(\frac{a}{2}\right)}$ in ${\mathrm{Ap}}_{\frac{a}{2}}\left(A_3\right)$ has exactly $a/2+1$ expressions because

$$\begin{array}{cc}\hfill (a-1)(a+2d)& =(d+i)a+(a-2i)(a+d)+(i-1)(a+2d)\hfill \\ \hfill & (1\le i\le \frac{a}{2}),\hfill \\ \hfill (a+d)+(a-1)(a+2d)& =(d+i)a+(a-2i+1)(a+d)\hfill \\ \hfill & +(i-1)(a+2d)(1\le i\le \frac{a}{2}),\hfill \\ \hfill 2(a+d)+(a-3)(a+2d)& =a+(a-2)(a+2d)\hfill \\ \hfill & =(d+i+2)a+(a-2i-2)(a+d)\hfill \\ \hfill & +(i-1)(a+2d)(1\le i\le \frac{a}{2}-1),\hfill \\ \hfill 3(a+d)+(a-3)(a+2d)& =a+(a+d)+(a-2)(a+2d)\hfill \\ \hfill & =(d+i+2)a+(a-2i-1)(a+d)\hfill \\ \hfill & +(i-1)(a+2d)(1\le i\le \frac{a}{2}-1),\hfill \\ \hfill 4(a+d)+(a-5)(a+2d)& =a+2(a+d)+(a-4)(a+2d)\hfill \\ \hfill & =2a+(a-3)(a+2d)\hfill \\ \hfill & =(d+i+4)a+(a-2i-4)(a+d)\hfill \\ \hfill & +(i-1)(a+2d)(1\le i\le \frac{a}{2}-2),\hfill \\ \hfill 5(a+d)+(a-5)(a+2d)& =a+3(a+d)+(a-4)(a+2d)\hfill \\ \hfill & =2a+(a+d)+(a-3)(a+2d)\hfill \\ \hfill & =(d+i+4)a+(a-2i-3)(a+d)\hfill \\ \hfill & +(i-1)(a+2d)(1\le i\le \frac{a}{2}-2),\hfill \\ \hfill \cdots \\ \hfill (a-2)(a+d)+(a+2d)& =ia+(a-2i-2)(a+d)+(i+1)(a+2d)\hfill \\ \hfill & (1\le i\le \frac{a}{2}-1)\hfill \\ \hfill & =(a+d-1)a,\hfill \\ \hfill (a-1)(a+d)+(a+2d)& =ia+(a-2i-1)(a+d)+(i+1)(a+2d)\hfill \\ \hfill & (1\le i\le \frac{a-1}{2})\hfill \\ \hfill & =(a+d-1)a+(a+d).\hfill \end{array}$$

But any element $m_j^{\left(\frac{a}{2}\right)}-a$ has $a/2$ expressions.

Since the maximal value in ${\mathrm{Ap}}_p\left(A_3\right)$ is at the position $(1,a/2-1+p)$, when a is even, for $0\le p\le a/2$,

$$\begin{array}{cc}\hfill g_p(a,a+d,a+2d)& =(a+d)+\left(\frac{a}{2}-1+p\right)(a+2d)-a\hfill \\ \hfill & =(a+2d)p+\frac{a(a-2)+2(a-1)d}{2}.\hfill \end{array}$$

However, when $p=a/2+1$, no element comes to the position $(0,a)$ or $(1,a)$ because there is no element of ${\mathrm{Ap}}_{\frac{a}{2}}\left(A_3\right)$ in the top row. Hence, after $p=a/2+1$, the pattern is shifted and the situation becomes irregular and complicated.

Concerning the number of representations, the elements in the staircase are

$$\begin{array}{cc}\hfill & \left(0,\frac{a}{2}+p-1\right),\left(1,\frac{a}{2}+p-1\right),\hfill \\ \hfill & \left(2,\frac{a}{2}+p-3\right),\left(3,\frac{a}{2}+p-3\right),\hfill \\ \hfill & \cdots \hfill \\ \hfill & \left(2p-4,\frac{a}{2}-p+3\right),\left(2p-3,\frac{a}{2}-p+3\right),\hfill \\ \hfill & \left(2p-2,\frac{a}{2}-p+1\right),\left(2p-1,\frac{a}{2}-p+1\right),\hfill \end{array}$$

and the elements in the large block are

$$\begin{array}{cc}\hfill & (2p,0),(2p,1),\cdots ,\left(2p,\frac{a}{2}-p-1\right),\hfill \\ \hfill & (2p+1,0),(2p+1,1),\cdots ,\left(2p+1,\frac{a}{2}-p-1\right).\hfill \end{array}$$

Hence,

$$\begin{array}{cc}\hfill & \sum _{j=0}^{a-1}{m}_j^{\left(p\right)}\hfill \\ \hfill & =\left(0+2+\cdots +(2p-2)\right)(a+d)+\left(1+3+\cdots +(2p-1)\right)(a+d)\hfill \\ \hfill & +2\left(\left(\frac{a}{2}-p+1\right)+\left(\frac{a}{2}-p+3\right)+\cdots +\left(\frac{a}{2}+p-1\right)\right)(a+2d)\hfill \\ \hfill & +\left(\frac{a}{2}-p\right)\left(2p\right)(a+d)+\left(\frac{a}{2}-p\right)(2p+1)(a+d)\hfill \\ \hfill & +2\left(0+1+\cdots +\left(\frac{a}{2}-p-1\right)\right)(a+2d)\hfill \\ \hfill & =(2p-1)p(a+d)+ap(a+2d)\hfill \\ \hfill & +\left(\frac{a}{2}-p\right)(4p+1)(a+d)+\left(\frac{a}{2}-p-1\right)\left(\frac{a}{2}-p\right)(a+2d)\hfill \\ \hfill & =\frac{a}{4}\left({(a+d)}^2-{(d+1)}^2+1-4p^2+4(2a+2d-1)p\right).\hfill \end{array}$$

(7)

Hence, by Lemma 1 (4)

$$\begin{array}{cc}\hfill & n_p(a,a+d,a+2d)\hfill \\ \hfill & =\frac{1}{4}\left({(a+d)}^2-{(d+1)}^2+1-4p^2+4(2a+2d-1)p\right)-\frac{a-1}{2}\hfill \\ \hfill & =\frac{(a-1)(a+2d-1)+1}{4}-p^2+(2a+2d-1)p.\hfill \end{array}$$

In [32] (3.9),

$$g\left(a,a+d,\cdots ,a+(k-1)d\right)=⌊\frac{a-2}{k-1}⌋a+(a-1)d,$$

In [32] (3.10),

$$n\left(a,a+d,\cdots ,a+(k-1)d\right)=\frac{(a-1)(q+d)+r(q+1)}{2},$$

where integers q and r are determined as

$$a-1=q(k-1)+r,0\le r<k-1.$$

4. Power Sums

More generally, we can show a formula for the p-Sylvester power sum

$$s_p^{\left(\mu \right)}(a_1,a_2,\cdots ,a_k)=\sum _{d\left(n\right)\le p}{n}^{\mu }(\mu \ge 1),$$

so that $s_p(a_1,a_2,\cdots ,a_k)=s_p^{\left(1\right)}(a_1,a_2,\cdots ,a_k)$ and $n_p(a_1,a_2,\cdots ,a_k)$$=s_p^{\left(0\right)}(a_1,a_2,\cdots ,a_k)$. Once we know the exact structure of every element in ${\mathrm{Ap}}_p\left(A\right)$, by applying Proposition 1, we can obtain the formula. Namely, we need to calculate $(m_i^{\left(p\right)}{)}^{\nu }$ for $\nu \ge 0$. From the previous section, when n is odd,

$$\begin{array}{cc}\hfill (m_i^{\left(p\right)}{)}^{\nu }& =\sum _{j=0}^{\nu }\left(\genfrac{}{}{0pt}{}{\nu }{j}\right)\sum _{k=0}^{2p-1}{k}^{\nu -j}{\left(\frac{a-1}{2}+p-k\right)}^j{(a+d)}^{\nu -j}{(a+2d)}^j\hfill \\ \hfill & +\sum _{j=0}^{\nu }\left(\genfrac{}{}{0pt}{}{\nu }{j}\right){\left(2p\right)}^{\nu -j}\sum _{k=0}^{\frac{a-1}{2}-p}{k}^j{(a+d)}^{\nu -j}{(a+2d)}^j\hfill \\ \hfill & +\sum _{j=0}^{\nu }\left(\genfrac{}{}{0pt}{}{\nu }{j}\right){(2p+1)}^{\nu -j}\sum _{k=0}^{\frac{a-1}{2}-p-1}{k}^j{(a+d)}^{\nu -j}{(a+2d)}^j\hfill \\ \hfill & =\sum _{j=0}^{\nu }\left(\genfrac{}{}{0pt}{}{\nu }{j}\right)(\sum _{k=0}^{2p-1}{k}^{\nu -j}{\left(\frac{a-1}{2}+p-k\right)}^j\hfill \\ \hfill & +{\left(2p\right)}^{\nu -j}\sum _{k=0}^{\frac{a-1}{2}-p}{k}^j+{(2p+1)}^{\nu -j}\sum _{k=0}^{\frac{a-1}{2}-p-1}{k}^j){(a+d)}^{\nu -j}{(a+2d)}^j.\hfill \end{array}$$

When n is even

$$\begin{array}{cc}\hfill (m_i^{\left(p\right)}{)}^{\nu }& =\sum _{j=0}^{\nu }\left(\genfrac{}{}{0pt}{}{\nu }{j}\right)\sum _{k=1}^p\left({(2k-2)}^{\nu -j}+{(2k-1)}^{\nu -j}\right){\left(\frac{a}{2}+p-2k+1\right)}^j\hfill \\ \hfill & \times {(a+d)}^{\nu -j}{(a+2d)}^j\hfill \\ \hfill & +\sum _{j=0}^{\nu }\left(\genfrac{}{}{0pt}{}{\nu }{j}\right){\left(2p\right)}^{\nu -j}\sum _{k=0}^{\frac{a}{2}-p-1}{k}^j{(a+d)}^{\nu -j}{(a+2d)}^j\hfill \\ \hfill & +\sum _{j=0}^{\nu }\left(\genfrac{}{}{0pt}{}{\nu }{j}\right){(2p+1)}^{\nu -j}\sum _{k=0}^{\frac{a}{2}-p-1}{k}^j{(a+d)}^{\nu -j}{(a+2d)}^j\hfill \\ \hfill & =\sum _{j=0}^{\nu }\left(\genfrac{}{}{0pt}{}{\nu }{j}\right)(\sum _{k=1}^p\left({(2k-2)}^{\nu -j}+{(2k-1)}^{\nu -j}\right){\left(\frac{a}{2}+p-2k+1\right)}^j\hfill \\ \hfill & +\left({\left(2p\right)}^{\nu -j}+{(2p+1)}^{\nu -j}\right)\sum _{k=0}^{\frac{a}{2}-p-1}{k}^j){(a+d)}^{\nu -j}{(a+2d)}^j.\hfill \end{array}$$

Hence, by Proposition 1, we obtain the generalized Sylvester power sum for $(a,a+d,a+2d)$.

Theorem 2.

Let a, d, p, and μ be integers with $a\ge 3$, $d>0$, $p\ge 0$, $\mu \ge 1$, and $gcd(a,d)=1$. Then, when a is odd, we have

$$\begin{array}{cc}\hfill & s_p^{\left(\mu \right)}(a,a+d,a+2d)\hfill \\ \hfill & =\frac{1}{\mu +1}\sum _{\kappa =0}^{\mu }\left(\genfrac{}{}{0pt}{}{\mu +1}{\kappa }\right)B_{\kappa }{a}^{\kappa -1}\sum _{i=0}^{a-1}\sum _{j=0}^{\mu +1-\kappa }\left(\genfrac{}{}{0pt}{}{\mu +1-\kappa }{j}\right)\hfill \\ \hfill & \times (\sum _{k=0}^{2p-1}{k}^{\mu +1-\kappa -j}{\left(\frac{a-1}{2}+p-k\right)}^j\hfill \\ \hfill & +{\left(2p\right)}^{\mu +1-\kappa -j}\sum _{k=0}^{\frac{a-1}{2}-p}{k}^j+{(2p+1)}^{\mu +1-\kappa -j}\sum _{k=0}^{\frac{a-1}{2}-p-1}{k}^j)\hfill \\ \hfill & \times {(a+d)}^{\mu +1-\kappa -j}{(a+2d)}^j\hfill \\ \hfill & +\frac{B_{\mu +1}}{\mu +1}(a^{\mu +1}-1).\hfill \end{array}$$

When a is even, we have

$$\begin{array}{cc}\hfill & s_p^{\left(\mu \right)}(a,a+d,a+2d)\hfill \\ \hfill & =\frac{1}{\mu +1}\sum _{\kappa =0}^{\mu }\left(\genfrac{}{}{0pt}{}{\mu +1}{\kappa }\right)B_{\kappa }{a}^{\kappa -1}\sum _{i=0}^{a-1}\sum _{j=0}^{\mu +1-\kappa }\left(\genfrac{}{}{0pt}{}{\mu +1-\kappa }{j}\right)\hfill \\ \hfill & \times (\sum _{k=1}^p\left({(2k-2)}^{\mu +1-\kappa -j}+{(2k-1)}^{\mu +1-\kappa -j}\right){\left(\frac{a}{2}+p-2k+1\right)}^j\hfill \\ \hfill & +\left({\left(2p\right)}^{\mu +1-\kappa -j}+{(2p+1)}^{\mu +1-\kappa -j}\right)\sum _{k=0}^{\frac{a}{2}-p-1}{k}^j)\hfill \\ \hfill & \times {(a+d)}^{\mu +1-\kappa -j}{(a+2d)}^j\hfill \\ \hfill & +\frac{B_{\mu +1}}{\mu +1}(a^{\mu +1}-1).\hfill \end{array}$$

In particular, when $\mu =2$, Theorem 2 reduces the formula of the p-Sylvester sum of the triple forming an arithmetic progression.

Corollary 1.

Let a and d be integers with $a\ge 3$, $d>0$ and $gcd(a,d)=1$. Then, for $0\le p\le ⌊a/2⌋$, when a is odd, we have

$$\begin{array}{cc}\hfill s_p(a,a+d,a+2d)& =\frac{(a-1)(a+2d-1)(a^2+2ad-a-d-2)}{24}\hfill \\ \hfill & +\frac{3a^3+9a^2(d-1)+2a(3d^2-9d+1)-6d^2+2d}{6}p\hfill \\ \hfill & +\frac{3a^2+a(6d-1)+4d^2-d}{2}{p}^2-\frac{3(a+d)}{2}{p}^3.\hfill \end{array}$$

When a is even, we have

$$\begin{array}{cc}\hfill s_p(a,a+d,a+2d)& =\frac{(a-1)(a+2d-1)(a^2+2ad-a-d-2)+3(a^2+2ad-d)}{24}\hfill \\ \hfill & +\frac{3a^3+9a^2(d-1)+a(6d^2-18d+5)-6d^2+5d}{6}p\hfill \\ \hfill & +\frac{3a^2+a(6d-1)+4d^2-d}{2}{p}^2-\frac{3(a+d)}{2}{p}^3.\hfill \end{array}$$

5. Weighted Sums

In this section, we consider the weighted sums whose numbers of representations are less than or equal to p [34,35]:

$$s_{\lambda ,p}^{\left(\mu \right)}(a_1,\cdots ,a_k):=\sum _{n\in {\mathit{Ap}}_p(a_1,\cdots ,a_k)}{\lambda }^n{n}^{\mu },$$

where $\lambda \ne 1$ and $\mu$ is a positive integer.

Here, Eulerian numbers $〈\genfrac{}{}{0pt}{}{n}{m}〉$ appear in the generating function

$$\sum _{k=0}^{\infty }{k}^n{x}^k=\frac{1}{{(1-x)}^{n+1}}\sum _{m=0}^{n-1}〈\genfrac{}{}{0pt}{}{n}{m}〉x^{m+1}(n\ge 1)$$

(8)

with $0^0=1$ and $〈\genfrac{}{}{0pt}{}{0}{0}〉=1$, and have an explicit formula

$$〈\genfrac{}{}{0pt}{}{n}{m}〉=\sum _{k=0}^m{(-1)}^k\left(\genfrac{}{}{0pt}{}{n+1}{k}\right){(m-k+1)}^n.$$

Then, an explicit formula of the p-weighted sum is given in terms of the elements in ${\mathrm{Ap}}_p(a_1,\cdots ,a_k)$ [29] (see also [30]).

Lemma 2.

Assume that $\lambda \ne 1$ and ${\lambda }^{a_1}\ne 1$. Then, for a positive integer μ,

$$\begin{array}{cc}\hfill & s_{\lambda ,p}^{\left(\mu \right)}(a_1,\cdots ,a_k)\hfill \\ \hfill & =\sum _{n=0}^{\mu }\frac{{(-a_1)}^n}{{({\lambda }^{a_1}-1)}^{n+1}}\left(\genfrac{}{}{0pt}{}{\mu }{n}\right)\sum _{j=0}^n〈\genfrac{}{}{0pt}{}{n}{n-j}〉{\lambda }^{j{a}_1}\sum _{i=0}^{a_1-1}{\left(m_i^{\left(p\right)}\right)}^{\mu -n}{\lambda }^{m_i^{\left(p\right)}}\hfill \\ \hfill & +\frac{{(-1)}^{\mu +1}}{{(\lambda -1)}^{\mu +1}}\sum _{j=0}^{\mu }〈\genfrac{}{}{0pt}{}{\mu }{\mu -j}〉{\lambda }^j.\hfill \end{array}$$

In order to obtain the formula for the p-Sylvester weighted power sum, we need to calculate $(m_i^{\left(p\right)}{)}^{\nu }{\lambda }^{m_i^{\left(p\right)}}$ for $\nu \ge 0$, ${\lambda }^a\ne 1$ and ${\lambda }^d\ne 1$. We use the formula

$$a^{\nu }{x}^a=\sum _{i=0}^{\nu }\left\{\genfrac{}{}{0pt}{}{\nu }{i}\right\}{x}^i\frac{d^i}{d{x}^i}{x}^a,$$

where $\left\{\genfrac{}{}{0pt}{}{n}{m}\right\}$ denote the Stirling numbers of the second kind, calculated as

$$\left\{\genfrac{}{}{0pt}{}{n}{m}\right\}=\frac{1}{m!}\sum _{i=0}^m{(-1)}^i\left(\genfrac{}{}{0pt}{}{m}{i}\right){(m-i)}^n.$$

From the previous section, when n is odd,

$$\begin{array}{cc}\hfill & (m_i^{\left(p\right)}{)}^{\nu }{\lambda }^{m_i^{\left(p\right)}}\hfill \\ \hfill & =\sum _{i=0}^{\nu }\left\{\genfrac{}{}{0pt}{}{\nu }{i}\right\}{\lambda }^i\left[\frac{d^i}{d{x}^i}\left(\sum _{l=0}^{2p-1}{x}^{l(a+d)+(\frac{a-1}{2}+p-l)(a+2d)}\right.\right.\hfill \\ \hfill & {\left.\left.+\sum _{l=0}^{\frac{a-1}{2}-p}{x}^{2p(a+d)+l(a+2d)}+\sum _{l=0}^{\frac{a-1}{2}-p-1}{x}^{(2p+1)(a+d)+l(a+2d)}\right)\right]}_{x=\lambda }\hfill \\ \hfill & =\sum _{i=0}^{\nu }\left\{\genfrac{}{}{0pt}{}{\nu }{i}\right\}{\lambda }^i\left[\frac{d^i}{d{x}^i}\left(\frac{x^{a(\frac{a-1}{2}+d+p)}(x^{2dp}-1)}{x^d-1}\right.\right.\hfill \\ \hfill & {\left.\left.+\frac{x^{2p(a+d)}(x^{(a+2d)(\frac{a+1}{2}-p)}-1)}{x^{a+2d}-1}+\frac{x^{(2p+1)(a+d)}(x^{(a+2d)(\frac{a-1}{2}-p)}-1)}{x^{a+2d}-1}\right)\right]}_{x=\lambda }.\hfill \end{array}$$

When n is even,

$$\begin{array}{cc}\hfill & (m_i^{\left(p\right)}{)}^{\nu }{\lambda }^{m_i^{\left(p\right)}}\hfill \\ \hfill & =\sum _{i=0}^{\nu }\left\{\genfrac{}{}{0pt}{}{\nu }{i}\right\}{\lambda }^i\left[\frac{d^i}{d{x}^i}\left(\sum _{l=0}^{p-1}{x}^{2l(a+d)+(\frac{a}{2}+p-2l-1)(a+2d)}\right.\right.\hfill \\ \hfill & +\sum _{l=0}^{p-1}{x}^{(2l+1)(a+d)+(\frac{a}{2}+p-2l-1)(a+2d)}\hfill \\ \hfill & {\left.\left.+\sum _{l=0}^{\frac{a}{2}-p-1}{x}^{2p(a+d)+l(a+2d)}+\sum _{l=0}^{\frac{a}{2}-p-1}{x}^{(2p+1)(a+d)+l(a+2d)}\right)\right]}_{x=\lambda }\hfill \\ \hfill & =\sum _{i=0}^{\nu }\left\{\genfrac{}{}{0pt}{}{\nu }{i}\right\}{\lambda }^i\left[\frac{d^i}{d{x}^i}\left(\frac{x^{\frac{a}{2}(a+2d-2+2p)}(x^{a+d}+1)(x^{2dp}-1)}{x^{2d}-1}\right.\right.\hfill \\ \hfill & {\left.\left.+\frac{x^{2(a+d)p}(x^{a+d}+1)(x^{(a+2d)(\frac{a}{2}-p)}-1)}{x^{a+2d}-1}\right)\right]}_{x=\lambda }.\hfill \end{array}$$

Hence, by Lemma 2, we obtain the generalized Sylvester weighted power sum for $(a,a+d,a+2d)$.

Theorem 3.

Let a, d, p, λ, and μ be integers with $a\ge 3$, $d>0$, $p\ge 0$, $\lambda \ne 1$, ${\lambda }^d\ne 1$, $\mu \ge 1$, and $gcd(a,d)=1$. Then, when a is odd, we have

$$\begin{array}{cc}\hfill & s_{\lambda ,p}^{\left(\mu \right)}(a,a+d,a+2d)\hfill \\ \hfill & =\sum _{n=0}^{\mu }\sum _{j=0}^n\sum _{i=0}^{\nu }\frac{{(-a)}^n}{{({\lambda }^a-1)}^{n+1}}\left(\genfrac{}{}{0pt}{}{\mu }{n}\right)〈\genfrac{}{}{0pt}{}{n}{n-j}〉\left\{\genfrac{}{}{0pt}{}{\nu }{i}\right\}{\lambda }^{ja+i}\hfill \\ \hfill & \times \left[\frac{d^i}{d{x}^i}\left(\frac{x^{a(\frac{a-1}{2}+d+p)}(x^{2dp}-1)}{x^d-1}\right.\right.\hfill \\ \hfill & {\left.\left.+\frac{x^{2p(a+d)}(x^{(a+2d)(\frac{a+1}{2}-p)}-1)}{x^{a+2d}-1}+\frac{x^{(2p+1)(a+d)}(x^{(a+2d)(\frac{a-1}{2}-p)}-1)}{x^{a+2d}-1}\right)\right]}_{x=\lambda }\hfill \\ \hfill & +\frac{{(-1)}^{\mu +1}}{{(\lambda -1)}^{\mu +1}}\sum _{j=0}^{\mu }〈\genfrac{}{}{0pt}{}{\mu }{\mu -j}〉{\lambda }^j.\hfill \end{array}$$

When a is even, we have

$$\begin{array}{cc}\hfill & s_{\lambda ,p}^{\left(\mu \right)}(a,a+d,a+2d)\hfill \\ \hfill & =\sum _{n=0}^{\mu }\sum _{j=0}^n\sum _{i=0}^{\nu }\frac{{(-a)}^n}{{({\lambda }^a-1)}^{n+1}}\left(\genfrac{}{}{0pt}{}{\mu }{n}\right)〈\genfrac{}{}{0pt}{}{n}{n-j}〉\left\{\genfrac{}{}{0pt}{}{\nu }{i}\right\}{\lambda }^{ja+i}\hfill \\ \hfill & \times \left[\frac{d^i}{d{x}^i}\left(\frac{x^{\frac{a}{2}(a+2d-2+2p)}(x^{a+d}+1)(x^{2dp}-1)}{x^{2d}-1}\right.\right.\hfill \\ \hfill & {\left.\left.+\frac{x^{2(a+d)p}(x^{a+d}+1)(x^{(a+2d)(\frac{a}{2}-p)}-1)}{x^{a+2d}-1}\right)\right]}_{x=\lambda }\hfill \\ \hfill & +\frac{{(-1)}^{\mu +1}}{{(\lambda -1)}^{\mu +1}}\sum _{j=0}^{\mu }〈\genfrac{}{}{0pt}{}{\mu }{\mu -j}〉{\lambda }^j.\hfill \end{array}$$

Remark 3.

The case $\lambda =1$ is not included in Theorem 3, but in Theorem 2.

6. Examples

For $(11,15,19)$, that is, $a=11$ and $d=4$, when $q=5$, by Theorem 1, Corollary 1, Theorems 2, and 3, we have

$$\begin{array}{cc}\hfill g_5(11,15,19)& =179,\hfill \\ \hfill n_5(11,15,19)& =165,\hfill \\ \hfill s_5(11,15,19)& =13605,\hfill \\ \hfill s_5^{\left(3\right)}(11,15,19)& =189158535(\mu =3),\hfill \\ \hfill s_{2,5}^{\left(3\right)}(11,15,19)& =46691295420476497563538523364517263\hfill \\ \hfill & 55433630648909109181546522(\lambda =2).\hfill \end{array}$$

For $(6,11,16)$, that is, $a=6$ and $d=5$, when $q=3$, we have

$$\begin{array}{cc}\hfill g_3(6,11,16)& =85,\hfill \\ \hfill n_3(6,11,16)& =73,\hfill \\ \hfill s_3(6,11,16)& =2675,\hfill \\ \hfill s_3^{\left(3\right)}(6,11,16)& =7652009(\mu =3),\hfill \\ \hfill s_{2,3}^{\left(3\right)}(6,11,16)& =24083450837052351738334815453210(\lambda =2).\hfill \end{array}$$

In fact, the integers whose representations in terms of $(6,11,16)$ are less than or equal to 3 are

$$0,\underset{59}{\underbrace{1,2,\cdots ,59}},61,62,63,64,65,67,68,69,73,74,75,79,85.$$

Hence, for example,

$$\begin{array}{cc}\hfill s_{2,3}^{\left(3\right)}(6,11,16)& =2^0·0^3+2^1·1^3+2^2·2^3+\cdots +2^{59}·{59}^3+2^{61}·{61}^3\hfill \\ \hfill & +2^{62}·{62}^3+2^{63}·{63}^3+2^{64}·{64}^3+2^{65}·{65}^3\hfill \\ \hfill & +2^{67}·{67}^3+2^{68}·{68}^3+2^{69}·{69}^3+2^{73}·{73}^3\hfill \\ \hfill & +2^{74}·{74}^3+2^{75}·{75}^3+2^{79}·{79}^3+2^{85}·{85}^3\hfill \\ \hfill & =24083450837052351738334815453210.\hfill \end{array}$$

7. Final Comments

It should not be thought that a similar repetitive process to [KLP,KP,KY] is simply going on in any triple. For example, it is known that some triples of Pell sequences do not follow a similar process but the formation of the elements of 0-Apéry set is different (in preparation).

In addition, it is still very difficult to find any explicit formula for four or more variables in the sequence of arithmetic progressions too. For the moment, only in the case of repunits [10], for $p\ge 0$ explicit formulas about four and five repunits are obtained, though the structures are even more complicated than for three variables. One of the reasons for the difficulties lies in the following. In the case of three variables, for any j ($j=0,1,\cdots ,a-1$), $m_j^{\left(0\right)}<m_j^{\left(1\right)}<\cdots$. However, in the case of four and more variables, for some j’s, $m_j^{\left(p\right)}=m_j^{(p+1)}$. This means that some elements in ${\mathrm{Ap}}_p\left(A\right)$ and in ${\mathrm{Ap}}_{p+1}\left(A\right)$ are overlapped.

Selmer [32] found a formula of the Frobenius number for almost arithmetic sequences by generalizing the previous result (Roberts [36] for $h=1$; Brauer [37] for $h=d=1$). For a positive integer h,

$$g_0(a,ha+d,\cdots ,ha+(k-1)d)=\left(h⌊\frac{a-2}{k-1}⌋+h-1\right)a+(a-1)d.$$

Selmer also gave an explicit formula for the Sylvester number $n_0(a,ha+d,\cdots ,ha+(k-1)d)$. Some formulas for the Sylvester sum $s_0(a,ha+d,\cdots ,ha+(k-1)d)$ and its variations are given in [38]. However, it is known that even when $d=2$ (the sequence of consecutive odd numbers), we have not found any explicit form of $g_p(a,a+2,\cdots ,ha+2(k-1))$ for general $p>0$.

Another problem is whether we can find any convenient formula when $p>⌊a/2⌋$.