On some properties of the number of permutations being products of pairwise disjoint $d$-cycles

TL;DR

This paper investigates the arithmetic properties of permutations composed of disjoint cycles of fixed length, including periodicity, divisibility, and p-adic valuations, extending previous research in the field.

Contribution

It introduces new polynomial families related to these permutations and provides a comprehensive analysis of their arithmetic and divisibility properties, extending prior work.

Findings

Characterization of periodicity modulo integers

Analysis of p-adic valuations of permutation counts

Identification of divisibility patterns and properties

Abstract

Let $d\geq 2$ be an integer. In this paper we study arithmetic properties of the sequence $(H_d(n))_{n\in\N}$, where $H_{d}(n)$ is the number of permutations in $S_{n}$ being products of pairwise disjoint cycles of a fixed length $d$. In particular we deal with periodicity modulo a given positive integer, behaviour of the $p$-adic valuations and various divisibility properties. Moreover, we introduce some related families of polynomials and study they properties. Among many results we obtain qualitative description of the $p$-adic valuation of the number $H_{d}(n)$ extending in this way earlier results of Ochiai and Ishihara, Ochiai, Takegehara and Yoshida.

Equations

$${\nu }_p(n):=\max \{k\in \mathbb{N}:p^k\mid n\}$$

$${\nu }_p(n_1{n}_2)={\nu }_p(n_1)+{\nu }_p(n_2)\text{mbox}and{\nu }_p(n_1+n_2)\ge \min \{{\nu }_p(n_1),{\nu }_p(n_2)\}.$$

$${\mathcal{H}}_d(x)=\sum _{n=0}^{\infty }\frac{H_d(n)}{n!}{x}^n.$$

$${\nu }_p(H_p(k{p}^2+jp+i))\ge k(p-1)+j,k\in \mathbb{N},i,j\in \{0,...,p-1\},$$

$$f_d(x+h)=f_d(x)+h{f}_d^{\prime }(x)+h^2{g}_d(x,h)$$

$$H_d(n)=H_d(n-1)+(n-1{)}_{(d-1)}{H}_d(n-d),$$

$$(u{)}_{(m)}=u(u-1)\cdot \dots \cdot (u-(m-1)).$$

$${\mathcal{H}}_d(x)=\sum _{n=0}^{\infty }\frac{H_d(n)}{n!}{x}^n=e^{x+\frac{x^d}{d}}.$$

$$H_d(n)=\sum _{k=0}^{\lfloor \frac{n}{d}\rfloor }\frac{n!}{(n-dk)!k!}\frac{1}{d^k}.$$

$$\sum_{k=0}^{n}{n\choose k}(-1)^{n-k}H_{d}(k)=\begin{cases}\begin{array}[]{lll}0,&&\mbox{if}\;n\not\equiv 0\pmod{d}\\ \frac{(md)!}{m!d^{m}},&&\mbox{if}\;n=md.\end{array}\end{cases}$$

$$\sum _{k=0}^n\left(\genfrac{}{}{0ex}{}{n}{k}\right)(-1{)}^k{H}_d(k)H_d(n-k)=0.$$

$$\sum_{k=0}^{n}{n\choose k}(-1)^{k}H_{d}(k)H_{d}(n-k)=\begin{cases}\begin{array}[]{lll}0,&&\mbox{if}\;n\not\equiv 0\pmod{d}\\ \frac{(md)!}{m!\left(\frac{d}{2}\right)^{m}},&&\mbox{if}\;n=md.\end{array}\end{cases}$$

$$H_d(n)={\zeta }_d^{-n}\sum _{k=0}^n\left(\genfrac{}{}{0ex}{}{n}{k}\right)({\zeta }_d-1{)}^k{H}_d(n-k).$$

$$\sum _{k=0}^n\left(\genfrac{}{}{0ex}{}{n}{k}\right){\zeta }_{2d}^k{H}_d(k)H_d(n-k)=(1+{\zeta }_{2d}{)}^n.$$

$$\sum _{k=0}^{\lfloor \frac{n}{2}\rfloor }\left(\genfrac{}{}{0ex}{}{n}{2k}\right)\frac{2^{n-2k}}{2k+1}{B}_{n-2k}{H}_d(2k+1)=(-1{)}^n{H}_d(n).$$

$$H_d(n)=1+\sum _{i=1}^n(i-1{)}_{(d-1)}{H}_d(i-d).$$

$$f(x)=\sum _{n=0}^{\infty }\frac{a_n}{n!}{x}^n,g(x)=\sum _{n=0}^{\infty }\frac{b_n}{n!}{x}^n$$

$$c_n=\sum _{k=0}^n\left(\genfrac{}{}{0ex}{}{n}{k}\right)a_k{b}_{n-k}.$$

$$f(x)=2x/(e^{2x}-1)=\sum _{n=0}^{\infty }\frac{2^n{B}_n}{n!}{x}^n,$$

$$g(x)=\frac{1}{2x}({\mathcal{H}}_d(x)-{\mathcal{H}}_d(-x))=\sum _{n=0}^{\infty }\frac{A_n}{n!}{x}^n,$$

$$H_d(n)-H_d(0)=\sum _{i=1}^n(i-1{)}_{(d-1)}{H}_d(i-d).$$

$$H_{p-1}(n)\equiv \{\begin{array}{l}1,\text{mbox}ifn\not\equiv -1(\mathrm{mod}p)\\ 2,\text{mbox}ifn\equiv -1(\mathrm{mod}p)\end{array}(\mathrm{mod}p).$$

$$\displaystyle H_{p-2}(n)\equiv\begin{cases}\begin{array}[]{lll}1,&&\mbox{ if }n\not\equiv-1,-2\pmod{p}\\ \frac{p+1}{2},&&\mbox{ if }n\equiv-2\pmod{p}\\ \frac{p+3}{2},&&\mbox{ if }n\equiv-1\pmod{p}\end{array}\end{cases}\pmod{p}.$$

$$H_{p-1}(N)=H_{p-1}(N-1)+(N-1{)}_{(p-2)}{H}_{p-1}(N-p+1)\equiv H_{p-1}(N-1)\equiv 1(\mathrm{mod}p),$$

$$H_{p-1}(N)$$

$$\equiv H_{p-1}(N-1)+(p-1)!H_{p-1}(N-p+1)\equiv 2-1=1(\mathrm{mod}p),$$

$$H_{p-1}(N)$$

$$\equiv H_{p-1}(N-1)+(p-2)!H_{p-1}(N-p+1)\equiv 1+1=2(\mathrm{mod}p),$$

$$H_{p-2}(N)=H_{p-2}(N-1)+(N-1{)}_{(p-3)}{H}_{p-2}(N-p+2)\equiv H_{p-2}(N-1)\equiv 1(\mathrm{mod}p),$$

$$H_{p-2}(N)$$

$$\equiv H_{p-2}(N-1)+\frac{(p-1)!}{2}{H}_{p-2}(N-p+2)\equiv \frac{p+3}{2}-\frac{1}{2}=\frac{p}{2}+1\equiv 1(\mathrm{mod}p),$$

$$H_{p-2}(N)$$

Full text

The research of the first author was partially supported by the grant of the Polish National Science Centre no. UMO-2018/29/N/ST1/00470

1. Introduction

We let $\mathbb{N}$ denote the set of non-negative integers, $\mathbb{N}_{+}$ the set of positive integers, $\mathbb{P}$ the set of prime numbers and finally we write $\mathbb{N}_{\geq k}$ for the set $\{n\in\mathbb{N}:\;n\geq k\}$. In the sequel we will also need the notion of the $p$-adic valuation of an integer, where $p\in\mathbb{P}$ is fixed. More precisely, if $n\in\mathbb{Z}$ then the number

[TABLE]

is called the $p$-adic valuation of $n$. We also adopt the standard convention that $\nu_{p}(0)=+\infty$. From the definition we easily deduce that for each $n_{1},n_{2}\in\mathbb{Z}$ the following properties hold:

[TABLE]

If $\nu_{p}(n_{1})\neq\nu_{p}(n_{2})$, then the inequality can be replaced by equality. Moreover, one can easily extend the notion of $p$-adic valuation to rational numbers $x=a/b,b\neq 0$, in the following way: $\nu_{p}(x)=\nu_{p}(a)-\nu_{p}(b)$.

Let $d\in\mathbb{N}_{\geq 2}$, $n\in\mathbb{N}$ and consider the number $H_{d}(n)$ of those $\sigma\in S_{n}$ which are products of pairwise disjoint cycles of length $d$. As usual, the identity permutation is also counted as a product of [math] cycles of length $d$. In particular, if $d=p\in\mathbb{P}$ is a prime number, then $H_{p}(n)$ counts the number of solutions in $S_{n}$ of the equation $\sigma^{p}=id$.

In the paper [1] the authors initiated the study of arithmetic properties of the sequence $(H_{d}(n))_{n\in\mathbb{N}}$ for $d=2$. In this case, the number $H_{2}(n)$ is the number of involutions in the group $S_{n}$. In particular, they obtained several combinatorial identities, presented description of the $2$-adic valuation of $H_{2}(n)$ and gave precise information about the rates of growth of $H_{2}(n)$. The mentioned paper can be seen as a complement of case $p=2$ of the papers [5, 10, 6, 7] concerning $p$-adic valuations of numbers $H_{p}(n)$, where $p$ is a prime number. The study of the sequence $(H_{p}(n))_{n\in\mathbb{N}}$ with $p$-prime, is quite natural because the number $H_{p}(n)$ counts the elements of order $p$ in the group $S_{n}$. However, it seems that there are no results concerning the general sequence $(H_{d}(n))_{n\in\mathbb{N}}$, where $d\in\mathbb{N}_{\geq 2}$ is not necessarily a prime. In particular, it should be stressed that there is no results on $p$-adic valuations of numbers $H_{d}(n)$, where $p$ is a prime number greater than $d$ (even in the case when $d$ is a prime). Our first aim is to fill this gap and present broad spectrum of results concerning various arithmetic properties of the sequence $(H_{d}(n))_{n\in\mathbb{N}}$ and also some families of polynomials related to them.

Let us introduce the content of the paper.

Section 2 is devoted to basic properties of the general sequence $(H_{d}(n))_{n\in\mathbb{N}}$. In particular, we recall the standard recurrence relation and closed formula for our sequence. Moreover, we present the expression for the exponential generating function

[TABLE]

With the help of the function $\mathcal{H}_{d}(x)$ we obtain several interesting identities involving elements of our sequence and related sequences (such as roots of unity or Bernoulli numbers).

In Section 3 we study periodicity properties of the sequences of remainders of numbers $H_{d}(n)$ modulo a given positive integer $c$. We start with the results for $c\in\{d+1,d+2\}$. We continue the work with the case of $c$ being of the form $d+k$, where $k$ is a fixed positive integer. Next we show that if $c$ is a power of a prime number not equal to $d$, then $c$ is a period of the sequence $(H_{d}(n)\pmod{c})_{n\in\mathbb{N}}$. At the end of the section, the result for composite $d$ and arbitrary $c$ or for $c$ co-prime to $d$ is given.

Section 4 begins with a revision of a lower estimate of the $p$-adic valuation of the number $H_{p}(n)$:

[TABLE]

where the prime number $p$ is fixed. We give a new proof of this known fact in order to obtain some results on periodicity of sequences $\left(\frac{H_{p}(n)}{p^{\beta_{n}}}\pmod{p^{r}}\right)_{n\in\mathbb{N}}$, where $r\in\mathbb{N}_{+}$ and $\beta_{n}$ is mentioned lower bound of $\nu_{p}(H_{p}(n))$ or $\beta_{n}=\nu_{p}(H_{p}(n))$. Moreover, we show that for each prime number $p$ and $j\in\{0,...,p-1\}$ there exists a $b_{j}\in\{0,...,p-1\}$ such that $H_{p}(kp^{2}+jp+b_{j})=k(p-1)+j$ for any $k\in\mathbb{N}$. These results can be seen as a complement of the series of papers [5, 10, 6, 7].

In Section 5 we describe the $p$-adic valuations of the numbers $H_{d}(n)$, where $p>d$. In order to do this, we show that the sequence $(H_{d}(n))_{n\in\mathbb{N}}$ is a restriction of a differentiable function $f_{d}:\mathbb{Z}_{p}\rightarrow\mathbb{Z}_{p}$, where $\mathbb{Z}_{p}$ is a ring of $p$-adic integers. Then, we prove that there exists a function $g_{d}:\mathbb{Z}_{p}\times p\mathbb{Z}_{p}\rightarrow\mathbb{Q}_{p}$ such that for any $x\in\mathbb{Z}_{p}$ and $h\in p\mathbb{Z}_{p}$ we have

[TABLE]

and $g_{d}(x,h)\in\mathbb{Z}_{p}$ if $d\geq 3$ or $p\mid f_{2}(x)$. At last, we obtain a qualitative description of the sequence $(\nu_{p}(H_{d}(n)))_{n\in\mathbb{N}}$ using Hensel’s lemma.

Section 6 is devoted to study of a family of polynomials $W_{d,m}(x)$ which are closely related to $m$-th derivative of the generating function $\mathcal{H}_{d}(x)$. More precisely, we have $\mathcal{H}^{(m)}_{d}(x)=W_{d,m}(x)\mathcal{H}_{d}(x)$. We show that $W_{d,m}(x)$ is a monic polynomial with integral coefficients and we give a formula for its coefficients in case of odd $d$. These coefficients are expressed in terms of (shifted) elements of the sequence $(H_{d}(n))_{n\in\mathbb{N}}$. Next, we compute the exponential generating function $\mathcal{W}_{d}(x,t)$ of the sequence $(W_{d,m}(x))_{m\in\mathbb{N}}$ and prove identities and congruences involving these polynomials. We finish the section with the proof of periodicity of the sequence $(x^{\left\lfloor\frac{m}{p}\right\rfloor p(1-p)}W_{p,m}(x)\pmod{p})_{m\in\mathbb{N}}$.

In Section 7 we deal with divisors of the number $H_{d}(n)$. The section is divided into three parts. In the first part we show that for each $d\geq 2$ the set of prime divisors of numbers $H_{d}(n)$ is infinite. In the second part we compute the greatest common divisor of numbers $H_{d}(n)-1$ and $n$. As a consequence, we get that the set prime divisors of numbers $H_{d}(n)-1$, $n\in\mathbb{N}$, is whole $\mathbb{P}$. The last part is devoted to the study of values $2\leq a<b$, $n\in\mathbb{N}$ and $c\in\mathbb{N}_{\geq 2}$ such that $c$ divides both $H_{a}(n)$ and $H_{b}(n)$.

In Section 8 we introduce the sequence of polynomials $(H_{d}(n,x))_{n\in\mathbb{N}}$ being a generalizations of the sequence $(H_{d}(n))_{n\in\mathbb{N}}$. Namely, $H_{d}(n,1)=H_{d}(n)$ and the coefficient near the $x^{k}$ in the polynomial $H_{d}(n,x)$ is the number of those permutations in $S_{n}$ which are products of pairwise disjoint $d$-cycles and have exactly $k$ fixed points. After that, we compute the remainders of polynomials $H_{d}(n,x)$ modulo $d$ and study coefficients of the polynomials $H_{2}(n-1,x)H_{2}(n+1,x)-H_{2}(n,x)^{2}$ and $H_{d}(n-d,x)H_{d}(n+d,x)-H_{d}(n,x)^{2}$. In particular, we prove that if $U(n,x)=H_{2}(n-1,x)H_{2}(n+1,x)-H_{2}(n,x)^{2}$, then $U(n,x)=V(n,x^{2})$, where $V\in\mathbb{Z}[x]$ has degree $n-1$ and all the coefficients of $V$ near $x^{i},i\neq 0,n-1$ are positive. Moreover, among some identities and congruences the most interesting result of this section is the result which says that the congruence $H_{d}(n-d,x)H_{d}(n+d,x)\equiv H_{d}(n,x)^{2}\pmod{d!}$ is true if and only if $d$ is a prime number or a square of a prime number.

Section 9 collects some observations, questions and conjectures related to objects introducted in previous sections.

2. First results

For $d\in\mathbb{N}_{\geq 2}$ we have $H_{d}(i)=1$ for $i\in\{0,1,\ldots,d-1\}$ by definition and for $n\geq d$ the standard combinatorial argument shows that

[TABLE]

where as usual, for $m\in\mathbb{N}$ the symbol $(u)_{(m)}$ denotes the falling factorial defined as

[TABLE]

Indeed, let us fix $\sigma\in S_{d,n}$. If $\sigma(n)=n$ then $\sigma=\sigma_{1}$ for some $\sigma_{1}\in S_{d,n-1}$ and it can be chosen by $H_{d}(n-1)$ ways. If $\sigma(n)\neq n$ then $\sigma=\sigma_{1}\circ\pi$, where $\pi$ is a $d$-cycle containing $n$ and $\sigma_{1}$ is a product of pairwise disjoint $d$-cycles on a set $\{1,...,n\}\backslash\mbox{supp}(\pi)$. Then $\sigma_{1}$ can be treated as a member of the set $S_{d,n-d}$. Thus, it can be chosen by $H_{d}(n-d)$ ways. Moreover, $\pi$ can be chosen in $(n-1)_{(d-1)}$ ways.

Furthermore, in the sequel we will also use the convention $H_{d}(n)=0$ for $n<0$. As a simple consequence of the recurrence formula we see that if $q\in\mathbb{N}$, with $q\mid(d-1)!$, then $H_{d}(n)\equiv 1\pmod{q}$ for each $n\in\mathbb{N}$. In particular, if $d$ is a composite number $>4$, then $H_{d}(n)\equiv 1\pmod{d}$. Moreover, if $p$ is a prime number $<d$, then $\nu_{p}(H_{d}(n))=0$ for each $n\in\mathbb{N}$.

It is well known that the exponential generating function for the sequence $(H_{d}(n))_{n\in\mathbb{N}}$ is given by

[TABLE]

In consequence, the exact expression for $H_{d}(n)$ is given by

[TABLE]

The knowledge of the closed form of exponential generating function allows us to obtain some identities involving numbers $H_{d}(n)$.

Theorem 2.1**.**

The following identities are true.

1. (1)

[TABLE] 2. (2)

For $n\in\mathbb{N}_{+}$ and $d\in\mathbb{N}_{\geq 3}$ an odd number we have

[TABLE] 3. (3)

For $n\in\mathbb{N}_{+}$ and $d\in\mathbb{N}_{\geq 2}$ an even number we have

[TABLE] 4. (4)

Let $\zeta_{d}$ be a $d$-th root of unity. Then

[TABLE] 5. (5)

Let $\zeta_{2d}$ be a $2d$-th root of unity satisfying $\zeta_{2d}^{d}=-1$. Then

[TABLE] 6. (6)

Let $d$ be an even number and $(B_{n})_{n\in\mathbb{N}}$ denote the sequence of Bernoulli numbers. Then

[TABLE] 7. (7)

For $n\in\mathbb{N}$ we have the identity

[TABLE]

Proof.

The identities (1)-(6) can be easily proved with the help of generating functions technique. Indeed, it is well known that for

[TABLE]

we have $f(x)g(x)=\sum_{n=0}^{\infty}\frac{c_{n}}{n!}x^{n}$ with

[TABLE]

In order to get the first identity we write $f(x)=\mathcal{H}_{d}(x)$ and $g(x)=e^{-x}$ and get $f(x)g(x)=e^{\frac{x^{d}}{d}}$. Comparing the coefficients on the both sides of this identity we get the result.

In order to get the second identity we put $f(x)=\mathcal{H}_{d}(x),g(x)=\mathcal{H}_{d}(-x)$. Because $d\geq 3$ is odd then $f(x)g(x)=1$ and hence the result.

The third identity can be proved in the same way. Taking $d$ even and $f(x)=\mathcal{H}_{d}(x),g(x)=\mathcal{H}_{d}(-x)$ we get $f(x)g(x)=e^{2\frac{x^{d}}{d}}$ and hence the result.

In order to get the fourth identity we put $f(x)=e^{(1-\zeta_{d})x},g(x)=\mathcal{H}_{d}(\zeta_{d}x)$. Then $f(x)g(x)=\mathcal{H}_{d}(x)$ and the identity follows.

The fifth identity follows by taking $f(x)=\mathcal{H}_{d}(\zeta_{2d}x),g(x)=\mathcal{H}_{d}(x)$. In this case $f(x)g(x)=e^{(1+\zeta_{2d})x}$ and we get required identity.

In order to get the sixth identity we put

[TABLE]

i.e., $f$ is the exponential generating function of the sequence $(2^{n}B_{n})_{n\in\mathbb{N}}$, and

[TABLE]

where $A_{n}=0$ for $n$ odd and $A_{n}=H_{d}(n+1)/(n+1)$ for $n$ even. With $f,g$ chosen in this way we get $f(x)g(x)=\mathcal{H}_{d}(-x)$ and comparing the coefficients near $x^{n}$ on both sides of this identity we get the result.

The last identity is a consequence of the recurrence relation (1). Indeed, rewriting (1) as $H_{d}(m)-H_{d}(m-1)=(m-1)_{(d-1)}H_{d}(m-d)$ and summing from $m=1$ to $n$ on both sides we get telescoping sum on the left and get

[TABLE]

The result follows. ∎

3. Periodicity of the numbers $H_{d}(n)$ modulo a given positive integer

We know that if $c<d$ or $c=d>4$ is a composite number then the sequence $(H_{d}(n)\pmod{c})_{n\in\mathbb{N}}$ is constant and equal to $1$. In this section we present some results concerning periodicity of the sequences $(H_{d}(n)\pmod{c})_{n\in\mathbb{N}}$ when $c>d$. We start with cases $c\in\{d+1,d+2\}$. As we will see, the behaviour of the sequence $(H_{d}(n)\pmod{c})_{n\in\mathbb{N}}$ depends mainly on the question whether $c$ is a prime or not.

Proposition 3.1**.**

Let $p$ be an odd prime number. Then for each $n\in\mathbb{N}$ we have

[TABLE]

In particular, $\nu_{p}(H_{p-1}(n))=0$ for any $n\in\mathbb{N}$.

If additionally $p>3$, then

[TABLE]

As a result, $\nu_{p}(H_{p-2}(n))=0$ for any $n\in\mathbb{N}$.

Proof.

We start with the computation of $H_{p-1}(n)\pmod{p}$. We proceed by induction on $n\in\mathbb{N}$. For $n\in\{0,...,p-2\}$ we have $H_{p-1}(n)=1$. Let us fix now $N\geq p-1$ and assume that congruence (3) is satisfied for each $n<N$. If $N\not\equiv-1,0\pmod{p}$ then by (1) we have

[TABLE]

since in the product of numbers $N-1,...,N-p+2$ there is a number divisible by $p$ and $N-1\not\equiv-1\pmod{p}$, which means that $H_{p-1}(N-1)\equiv 1\pmod{p}$. If $N\equiv 0\pmod{p}$, then

[TABLE]

since $N-1\equiv-1\pmod{p}$, $N-p+1\equiv 1\not\equiv-1\pmod{p}$ ($p>2$) and by Wilson’s theorem $(p-1)!\equiv-1\pmod{p}$. If $N\equiv-1\pmod{p}$, then

[TABLE]

since $N-1$ and $N-p+1$ are not congruent to $-1$ modulo $p$ and $(p-2)!\equiv 1\pmod{p}$ as an immediate consequence of Wilson’s theorem.

The proof of congruence (4) is analogous. We proceed by induction on $n\in\mathbb{N}$. For $n\in\{0,...,p-3\}$ we have $H_{p-2}(n)=1$. Let us fix now $N\geq p-2$ and assume that congruence (4) is satisfied for each $n<N$. If $N\not\equiv-2,-1,0\pmod{p}$, then by (1) we have

[TABLE]

since in the product of numbers $N-1,...,N-p+3$ there is a number divisible by $p$ and $N-1\not\equiv-2,-1\pmod{p}$, which means that $H_{p-1}(N-1)\equiv 1\pmod{p}$. If $N\equiv 0\pmod{p}$, then

[TABLE]

since $N-1\equiv-1\pmod{p}$, $N-p+2\equiv 2\not\equiv-2,-1\pmod{p}$ ($p\geq 5$) and by Wilson’s theorem $(p-1)!\equiv-1\pmod{p}$. If $N\equiv-1\pmod{p}$, then

[TABLE]

since $N-1\equiv-2\pmod{p}$, $N-p+2\equiv 1\not\equiv-2,-1\pmod{p}$ ($p\geq 5$) and $(p-2)!\equiv 1\pmod{p}$ as an immediate consequence of Wilson’s theorem. If $N\equiv-2\pmod{p}$, then

[TABLE]

since $N-1\equiv-3\not\equiv-2,-1\pmod{p}$, $N-p+2\equiv 0\not\equiv-2,-1\pmod{p}$ ($p\geq 5$) and $(p-3)!\equiv-\frac{1}{2}\pmod{p}$ as an easy consequence of Wilson’s theorem. ∎

Proposition 3.2**.**

Let $d$ be a positive integer at least $5$. If $d+1$ is a composite number, then for each $n\in\mathbb{N}$ we have $H_{d}(n)\equiv 1\pmod{d+1}$.

Let $d$ be a positive integer at least $4$. If $d+2$ is a composite number, then for each $n\in\mathbb{N}$ we have $H_{d}(n)\equiv 1\pmod{d+2}$.

Proof.

Since $H_{d}(n)=1$ for $n\in\{0,...,d-1\}$, $H_{d}(n)=H_{d}(n-1)+(n-1)_{(d-1)}H_{d}(n-d)$ for $n\geq d$ and $(d-1)!\mid(n-1)_{(d-1)}$ for any $n\in\mathbb{N}$, it suffices to prove that $d+1\mid(d-1)!$ in the first part of the statement of our theorem and $d+2\mid(d-1)!$ in the second part.

At first, we show $d+1\mid(d-1)!$ if $d\geq 5$ and $d+1$ is a composite number. Let $q$ be the least divisor of $d+1$ greater than $1$. Then $\frac{d+1}{q}\leq\frac{d+1}{2}<d-1$, since $d\geq 5$. If $q<\frac{d+1}{q}$, then $q$ and $\frac{d+1}{q}$ are two distinct positive integers appearing as factors in $(d-1)!$, thus $d+1\mid(d-1)!$. If $q=\frac{d+1}{q}$ then $d+1=q^{2}$. Since $d+1\geq 6$ thus $q\geq 3$. Then $2q<q^{2}-2=d-1$ and $q,2q$ appear as factors in $(d-1)!$. Hence $d+1\mid(d-1)!$.

Now we prove $d+2\mid(d-1)!$ if $d\geq 4$ and $d+2$ is a composite number. Let $q$ be the least divisor of $d+2$ greater than $1$. Then $\frac{d+2}{q}\leq\frac{d+2}{2}\leq d-1$, since $d\geq 4$. If $q<\frac{d+2}{q}$, then $q$ and $\frac{d+2}{q}$ are two distinct positive integers appearing as factors in $(d-1)!$, thus $d+2\mid(d-1)!$. If $q=\frac{d+2}{q}$ then $d+2=q^{2}$. Since $d+2\geq 6$ thus $q\geq 3$. Then $2q\leq q^{2}-3=d-1$ and $q,2q$ appear as factors in $(d-1)!$. Hence $d+1\mid(d-1)!$. ∎

According to the last proposition and numerical computations, we prove that for a fixed positive integer $k$ and sufficiently large positive integer $d$ such that $d+k$ is a composite number, the sequence $(H_{d}(n)\pmod{d+k})_{n\in\mathbb{N}}$ is constant and equal to $1$.

Theorem 3.3**.**

Let us fix $k\in\mathbb{N}_{+}$. Then for each positive integer $d\geq\max\{k+2,3+2\sqrt{k+2}\}$ such that $d+k$ is a composite number there holds $H_{d}(n)\equiv 1\pmod{d+k}$ for all $n\in\mathbb{N}$.

Proof.

Similarly as in the proof of the previous proposition, it suffices to show that $d+k\mid(d-1)!$. Let $q$ be the least divisor of $d+k$ greater than $1$. Then $\frac{d+k}{q}\leq\frac{d+k}{2}\leq d-1$, since $d\geq k+2$. If $q<\frac{d+k}{q}$, then $q$ and $\frac{d+k}{q}$ are two distinct positive integers appearing as factors in $(d-1)!$, thus $d+k\mid(d-1)!$. If $q=\frac{d+k}{q}$ then $d+k=q^{2}$. Since $3+2\sqrt{k+2}=(1+\sqrt{k+2})^{2}-k$ and $d\geq(1+\sqrt{k+2})^{2}-k$, we have $q=\sqrt{d+k}\geq 1+\sqrt{k+2}$. As a consequence, $2q\leq q^{2}-k-1=d-1$ and $q,2q$ appear as factors in $(d-1)!$. Hence $d+k\mid(d-1)!$. ∎

For our next result, we need the following auxiliary lemma.

Lemma 3.4**.**

Let $p$ be a prime number and $d$ be a composite positive integer divisible by $p$. Assume that $(p,d)\neq(2,4)$. Then $\frac{d-2}{p}\geq\nu_{p}(d)$.

Proof.

If $\nu_{p}(d)=1$ then $d\geq 2p$ as $d$ is a composite number. We thus have

[TABLE]

as $p\geq 2$. If $p\geq 3$ and $\nu_{p}(d)\geq 2$ or $p=2$ and $\nu_{2}(d)\geq 3$ then

[TABLE]

which implies $\frac{d-2}{p}\geq\nu_{p}(d)$. If $p=2$, $\nu_{2}(d)=2$ and $d\neq 4$ then $d\geq 3\cdot 4$ and

[TABLE]

Our lemma is proved. ∎

We are ready to prove the main result of the section. It concerns periodicity of the sequence $(H_{d}(n)\pmod{p^{r}})_{n\in\mathbb{N}}$, where $p$ is a prime number not equal to $d$ and $r$ is any positive integer. More precisely, we have the following

Theorem 3.5**.**

Let $d,r$ be positive integers with $d\geq 2$. Let $p$ be a prime number not equal to $d$. Assume that $(d,p,r)\neq(4,2,2)$. Then the sequence $(H_{d}(n)\pmod{p^{r}})_{n\in\mathbb{N}}$ is periodic of period $p^{r}$. Moreover, if $p>d$, then $p^{r}$ is the basic period of the sequence $(H_{d}(n)\pmod{p^{r}})_{n\in\mathbb{N}}$.

Proof.

Let us notice that for the proof that $p^{r}$ is a period of $(H_{d}(n)\pmod{p^{r}})_{n\in\mathbb{N}}$ we only need to show that

[TABLE]

Then, using (1) and a simple induction on $n\in\mathbb{N}$, we prove that $H_{d}(n+p^{r})\equiv H_{d}(n)\pmod{p^{r}}$.

In order to prove (5) we will use the exact formula

[TABLE]

and show that for $k>1$, the $k$-th summand in the above sum has the $p$-adic valuation greater than $r$. We write this summand:

[TABLE]

It suffices to show, that $\nu_{p}\left(\frac{(p^{r}-1)_{(dk-1)}}{k!}\frac{1}{d^{k}}\right)\geq 0$. If $\nu_{p}(d)=0$ then the mentioned inequality is true. We thus assume that $\nu_{p}(d)>0$. Since $(dk-1)!\mid(p^{r}-1)_{(dk-1)}$, we have

[TABLE]

We estimate $\nu_{p}((dk-1)_{((d-1)k-1)})$ from below by number of multiples of $p$ among factors $dk-1,dk-2,...,k+1$ and use Lemma 3.4 to obtain the following.

[TABLE]

This implies $\nu_{p}\left(\frac{(p^{r}-1)_{(dk-1)}}{k!}\frac{1}{d^{k}}\right)\geq 0$ and finishes the proof of (5).

We need to show that $p^{r}$ is the basic period of the sequence $(H_{d}(n)\pmod{p^{r}})_{n\in\mathbb{N}}$ provided that $p>d$. Let us assume by contrary that $p^{r-1}$ is a period of $(H_{d}(n)\pmod{p^{r}})_{n\in\mathbb{N}}$. If $r=1$ then we directly obtain a contradiction, since the sequence $(H_{d}(n)\pmod{p})_{n\in\mathbb{N}}$ is not constant. Indeed, $H_{d}(d)=1+(d-1)!\not\equiv 1\pmod{p}$ as $d<p$. If $r>1$, then we consider the congruences

[TABLE]

that are equivalent to

[TABLE]

Since $H_{d}(p^{r-1}+d-1)\equiv H_{d}(d-1)\pmod{p^{r}}$, $H_{d}(p^{r-1}+d)\equiv H_{d}(d)\pmod{p^{r}}$ and $H_{d}(p^{r-1})\equiv H_{d}(0)\equiv H_{d}(p^{r-1}+1)\equiv H_{d}(1)\equiv 1\pmod{p^{r}}$, we get the following:

[TABLE]

and equivalently

[TABLE]

After simplification (where we divide by $(d-1)!$ and $d!$, respectively, and these numbers are coprime to $p$) we obtain two congruences

[TABLE]

Subtracting the second congruence from the first one, we get $1-\frac{1}{d}\equiv 0\pmod{p}$, or equivalently $\frac{d-1}{d}\equiv 0\pmod{p}$. This is impossible since $0<d-1<p$. Hence $p^{r}$ must be the basic period of the sequence $(H_{d}(n)\pmod{p^{r}})_{n\in\mathbb{N}}$. ∎

Remark 3.6**.**

In the case of $(d,p,r)=(4,2,2)$ the sequence $(H_{4}(n)\pmod{4})_{n\in\mathbb{N}}$ has the basic period $8$. More precisely, we have

[TABLE]

Proof.

We prove by induction on $m\in\mathbb{N}$ that

[TABLE]

We check that congruence (6) holds for $m=0$ and $i\in\{0,1,2,3,4,5,6,7\}$. Assume now that it is satisfied by some $m\in\mathbb{N}$. By direct calculations we show (6) for $m+1$. ∎

Example 3.7**.**

If $p<d$, then it is possible that $p^{r}$ is not the basic period of the sequence $(H_{d}(n)\pmod{p^{r}})_{n\in\mathbb{N}}$. For example, if $d=5$, $p=2$, $r=4$, then we obtain a sequence $(H_{5}(n)\pmod{16})_{n\in\mathbb{N}}$, which has a period $8<2^{4}$.

Another example is for $d=10$, $p=3$, $r=5$. The basic period of the sequence $(H_{10}(n)\pmod{243})_{n\in\mathbb{N}}$ is $27<3^{5}$.

Based on the above considerations we can give precise value of the period of the sequence $(H_{d}(n)\pmod{c})_{n\in\mathbb{N}}$ provided that $d$ is a composite number or $d\nmid c$.

Corollary 3.8**.**

Let $c,d\in\mathbb{N}_{+}$ and $d>1$. Assume additionally that $d$ is a composite number or $d\nmid c$. Then the sequence $(H_{d}(n)\pmod{c})_{n\in\mathbb{N}}$ is periodic of period $2c$ if $d=4$ and $\nu_{2}(c)=2$ and $c$ otherwise.

4. The behaviour of the $p$-adic valuation of $H_{p}(n)$ for some $p$

Amdeberhan and Moll were able to compute the exact value of the 2-adic valuation of $H_{2}(n)$ for $n\in\mathbb{N}$. Quite unexpected they proved that for given $i\in\{0,1,2,3\}$ the sequence $(\nu_{2}(H_{2}(4n+i))-n)_{n\in\mathbb{N}}$ is constant. This raises natural question whether the sequence of $p$-adic valuations of $H_{p}(n)$ can share similar property. In fact, this question was studied earlier by Ochiai in [10]. In the cited paper the reader can find the formulae for the $p$-adic valuation of the numbers $H_{p}(n)$, $n\in\mathbb{N}$, where $p$ is a prime number at most equal to $11$. Actually, Ochiai in his paper gave a qualitative description of the sequence $(\nu_{p}(H_{p}(n)))_{n\in\mathbb{N}}$ for any prime number $p\leq 23$. Further, Ishihara, Ochiai, Takegahara and Yoshida extend this result for any prime number $p$ in [6]. In particular, the following inequality holds true

[TABLE]

for all $n\in\mathbb{N}$, where the equality holds if $p\mid\left\lfloor\frac{n}{p}\right\rfloor$. This inequality was proved for $p=2$ by Chowla, Herstein and Moore in [3]. In general, this inequality was proved by Grady and Newman in [5]. Moreover, in 2010 Kim and Kim gave a combinatorial proof of the above inequality. Despite this facts we would like to give the proof of (7) different than the ones presented by mentioned authors. In consequence, we will be able to prove the following two results which have not appeared yet in the literature.

Theorem 4.1**.**

For each odd prime number $p$ the sequence

[TABLE]

is periodic with the basic period $p^{2}$. Moreover, the sequence

[TABLE]

has basic period equal to $2p^{2}$.

Proposition 4.2**.**

For each prime number $p$ there are numbers $b_{0},...,b_{p-1}\in\{0,...,p-1\}$ such that $b_{0}=p-1$, $b_{j-1}-b_{j}\in\{0,1\}$ for $j\in\{1,...,p-1\}$ and $\nu_{p}(H_{p}(kp^{2}+jp+b_{j}))=k(p-1)+j$ for all $k\in\mathbb{N}$ and $j\in\{0,...,p-1\}$. In particular, $b_{j}\geq p-j-1$.

We start with one lemma. We omit its proof as it can be found in [6, Lemma 2.1].

Lemma 4.3**.**

If $p$ is an odd prime number and $k$ is a positive integer then

[TABLE]

At this moment, we give a result on congruences involving numbers $H_{p}(n)$, $n\in\mathbb{N}$. This result is crucial in the proof of Theorem 4.1.

Theorem 4.4**.**

For odd prime number $p$, a non-negative integer $k$ and integers $i,j\in\{0,1,...,p-1\}$ we have

[TABLE]

Proof.

We prove the congruences concerning numbers $H_{p}(n)$ for $n\in\mathbb{N}$. We proceed by induction on $n$. We write $n=kp^{2}+jp+i$ with $k\in\mathbb{N}$ and $i,j\in\{0,...,p-1\}$. If $k=j=0$, then the statement of the theorem holds for all $i\in\{0,...,p-1\}$.

Let us assume that $n=kp^{2}$ for some $k\in\mathbb{N}_{+}$. By induction hypothesis for $(k-1)p^{2}+(p-1)p+p-1$ and $(k-1)p^{2}+(p-1)p$, Wilson’s theorem and Lemma 4.3 we obtain

[TABLE]

Assume now that $n=kp^{2}+jp$ for $k\in\mathbb{N}$ and $j\in\{1,...,p-1\}$. By the recurrence (1), induction hypothesis for $n=kp^{2}+(j-1)p+p-1$, Lemma 4.3 and Wilson’s theorem we have

[TABLE]

since $p^{k(p-1)+j-1-t}\mid H_{p}(kp^{2}+(j-1-t)p)$.

At this moment we assume that $n=kp^{2}+jp+i$ for $k\in\mathbb{N}$ and $i,j\in\{0,...,p-1\}$. If $i=0$, then the third congruence obviously is true. For $i>0$, by (1), induction hypothesis for $n=kp^{2}+jp+i-1$ and Wilson’s theorem we have

[TABLE]

∎

We are ready to prove the lower bound for the $p$-adic valuation of $H_{p}(n)$.

Corollary 4.5**.**

For odd prime number $p$, non-negative integer $k$ and integers $i,j\in\{0,1,...,p-1\}$ we have $\nu_{p}(H_{p}(kp^{2}+jp+i))\geq k(p-1)+j$, where the inequality is in fact equality for $j=0$. In other words,

[TABLE]

for all $n\in\mathbb{N}$.

Proof.

We only need to prove that $\nu_{p}(H_{p}(kp^{2}+jp+i))=k(p-1)+j$ for $j=0$. We proceed by induction on $i\in\{0,...,p-1\}$. The equality $\nu_{p}(H_{p}(kp^{2}+i))=k(p-1)$ holds for $i=0$ by Theorem 4.4. If $i>0$, then we write

[TABLE]

Then $\nu_{p}((kp^{2}+i-1)_{(p-1)})\geq 2$, since $kp^{2}$ appears as a factor in $(kp^{2}+i-1)_{(p-1)}$. We know that $\nu_{p}(H_{p}((k-1)p^{2}+(p-1)p+i))\geq(k-1)(p-1)+(p-1)=k(p-1)$. Thus the summand $(kp^{2}+i-1)_{(p-1)}H_{p}((k-1)p^{2}+(p-1)p+i)$ has the $p$-adic valuation at least $k(p-1)+2$ while, by induction hypothesis $\nu_{p}(H_{p}(kp^{2}+i-1))=k(p-1)$. Hence, we get $\nu_{p}(H_{p}(kp^{2}+i))=k(p-1)$. ∎

Now we give the proofs of the main results of this section.

Proof of Theorem 4.1.

Let us define $\gamma_{n}=\left\lfloor\frac{n}{p^{2}}\right\rfloor\cdot(p-1)+\left(\left\lfloor\frac{n}{p}\right\rfloor\pmod{p}\right)$ for simplicity of notation. At first, we show that

[TABLE]

for each $n\in\mathbb{N}$. We write $n=kp^{2}+jp+i$, $k\in\mathbb{N}$, $i,j\in\{0,1,...,p-1\}$, and proceed by induction on $jp+i$. By Theorem 4.4 we see that the congruence (8) is satisfied for $jp+i=0$. If $jp+i>0$ and $i>0$ then

[TABLE]

If $jp+i>0$ and $i=0$ then we perform similar computations as in the proof of Theorem 4.4.

[TABLE]

We are left with proving that $p^{2}$ is a basic period of the sequence $\left((-1)^{\left\lfloor\frac{n}{p^{2}}\right\rfloor}\frac{H_{p}(n)}{p^{\gamma_{n}}}\pmod{p}\right)_{n\in\mathbb{N}}$. It suffices to show that $p$ is not a period of the sequence $\left((-1)^{\left\lfloor\frac{n}{p^{2}}\right\rfloor}\frac{H_{p}(n)}{p^{\gamma_{n}}}\pmod{p}\right)_{n\in\mathbb{N}}$. In order to do this, we assume the contrary. In particular, we have $\frac{H_{p}(p+1)}{p}\equiv H_{p}(1)=1\pmod{p}$. Using recurrence relation for numbers $H_{p}(n)$ we obtain the congruences

[TABLE]

or equivalently

[TABLE]

Since $p$ is a period of the sequence $\left((-1)^{\left\lfloor\frac{n}{p^{2}}\right\rfloor}\frac{H_{p}(n)}{p^{\gamma_{n}}}\pmod{p}\right)_{n\in\mathbb{N}}$, we thus have $\frac{H_{p}(p)}{p}\equiv H_{p}(0)=1\pmod{p}$. Hence,

[TABLE]

which means that

[TABLE]

However, the number $(p-1)_{(p-2)}$ is not divisible by $p$. A contradiction shows that $p$ is not a period of the sequence $\left((-1)^{\left\lfloor\frac{n}{p^{2}}\right\rfloor}\frac{H_{p}(n)}{p^{\gamma_{n}}}\pmod{p}\right)_{n\in\mathbb{N}}$.

The sequence $\left(\frac{H_{p}(n)}{p^{\gamma_{n}}}\pmod{p}\right)_{n\in\mathbb{N}}$ is thus periodic with period $2p^{2}$. We know, that $p^{2}$ is not a period of this sequence, as $\frac{H_{p}(kp^{2})}{p^{k(p-1)}}\equiv(-1)^{k}\pmod{p}$. The number $2$ also cannot be a period of this sequence. If we assume the contrary then, since $H_{p}(0)\equiv H_{p}(1)\equiv 1\pmod{p}$, we have $\frac{H_{p}(n)}{p^{\gamma_{n}}}\equiv 1\pmod{p}$. This stays in contradiction with the fact, that $\frac{H_{p}(p^{2})}{p^{p-1}}\equiv-1\pmod{p}$. It suffices to show that $2p$ is not a period of the sequence $\left(\frac{H_{p}(n)}{p^{\gamma_{n}}}\pmod{p}\right)_{n\in\mathbb{N}}$. In order to do this, we assume the contrary. In particular, we have $\frac{H_{p}(2p+1)}{p^{2}}\equiv H_{p}(1)=1\pmod{p}$ and $\frac{H_{p}(2p+2)}{p^{2}}\equiv H_{p}(2)=1\pmod{p}$. Using recurrence relation for numbers $H_{p}(n)$ we obtain the congruences

[TABLE]

or equivalently

[TABLE]

Since $2p$ is a period of the sequence $\left(\frac{H_{p}(n)}{p^{\gamma_{n}}}\pmod{p}\right)_{n\in\mathbb{N}}$, we thus have $\frac{H_{p}(2p)}{p^{2}}\equiv H_{p}(0)=1\pmod{p}$ and $\frac{H_{p}(2p+1)}{p^{2}}\equiv H_{p}(1)=1\pmod{p}$. Hence,

[TABLE]

which means that

[TABLE]

The numbers $2(p-1)_{(p-2)}$ and $2(2p+1)(2p-1)_{(p-3)}$ are both not divisible by $p$. Hence, the numbers $H_{p}(p+1)$ and $H_{p}(p+2)$ are divisible by $p^{2}$. On the other hand, $H_{p}(p+2)=H_{p}(p+1)+(p+1)_{(p-1)}H_{p}(2)=H_{p}(p+1)+(p+1)p(p-1)_{(p-3)}$. The number $(p+1)p(p-1)_{(p-3)}$ is not divisible by $p^{2}$. This is why the numbers $H_{p}(p+1)$ and $H_{p}(p+2)$ cannot be both divisible by $p^{2}$. A contradiction shows that $p$ is not a period of the sequence $\left(\frac{H_{p}(n)}{p^{\gamma_{n}}}\pmod{p}\right)_{n\in\mathbb{N}}$. ∎

Proof of Proposition 4.2.

If $p=2$, then the result is well known (see for example [1, Theorem 4.1]). From Corollary 4.5 we know that $\nu_{p}(H_{p}(p-1))=0$. Hence we put $b_{0}=p-1$. Let us fix $j\in\{1,...,p-1\}$ and assume by induction hypothesis that we have $b_{j-1}\in\{p-j,...,p-1\}$ satisfies the equality $\nu_{p}(H_{p}((j-1)p+b_{j-1}))=j-1$. By Corollary 4.5 we have $\nu_{p}(H_{p}(jp+b_{j-1}-1))\geq j$ and $\nu_{p}(H_{p}(jp+b_{j-1}))\geq j$. Moreover, $\nu_{p}((jp+b_{j-1}-1)_{(p-1)})=1$. By the equality

[TABLE]

since $\nu_{p}((jp+b_{j-1}-1)_{(p-1)}H_{p}((j-1)p+b_{j-1}))=j$, we infer that at least one of the numbers $H_{p}(jp+b_{j-1})$, $H_{p}(jp+b_{j-1}-1)$ has the $p$-adic valuation equal to $j$. We thus take $b_{j}$ as one of the values $b_{j-1}-1$, $b_{j-1}$ such that $\nu_{p}(H_{p}(jp+b_{j}))=j$. In particular, $b_{j}\geq p-j-1$. At last, we use Theorem 4.1 to obtain

[TABLE]

since $\nu_{p}(H_{p}(jp+b_{j}))=j$. Hence $\nu_{p}(H_{p}(kp^{2}+jp+b_{j}))=k(p-1)+j$ for each $k\in\mathbb{N}$. ∎

In Theorem 4.1 we proved periodicity of the sequence $(H_{p}(n)/p^{\gamma_{p}(n)})_{n\in\mathbb{N}}$, where

[TABLE]

In general, we ask the following.

Question 4.6**.**

For which $p\in\mathbb{P}$ and $w\in\mathbb{N}_{+}$ the sequence

[TABLE]

is periodic?

Theorem 4.7**.**

For each prime number $p$ and positive integer $w$ the sequence

[TABLE]

is periodic with period $p^{2w+1}(p-1)$.

Proof.

By [6, Theorem B] we know that there exist power series $\lambda,f_{r}\in\mathbb{Z}_{p}[[x]]$, $r\in\{0,...,p^{2}-1\}$, convergent on $\mathbb{Z}_{p}$ such that $H_{p}(kp^{2}+r)=p^{k(p-1)}f_{r}(k)\prod_{l=1}^{k}\lambda(l)$ for each $k\in\mathbb{N}$ and $\nu_{p}(H_{p}(kp^{2}+r))=k(p-1)+\nu_{p}(f_{r}(k))$. Let us take any $n\in\mathbb{N}$ and write $n=kp^{2}+r$ for some $k\in\mathbb{N}$ and $r\in\{0,...,p^{2}-1\}$. Then, by the above fact we have the following chain of congruences for any $t\in\mathbb{N}$:

[TABLE]

where we use Euler’s theorem as $p\nmid\lambda(l)$ for any $l\in\mathbb{N}$. ∎

Let us define a particular subset of the set of prime numbers:

[TABLE]

Then we are able to give a partial answer to Question 4.6.

Corollary 4.8**.**

If $p\in\mathcal{A}$ then for each $w\in\mathbb{N}_{+}$ the sequence $\left(\frac{H_{p}(n)}{p^{\nu_{p}(H_{p}(n))}}\pmod{p^{w}}\right)_{n\in\mathbb{N}}$ is periodic with period $p^{2w+2\alpha(p)+1}(p-1)$, where $\alpha(p)=\max_{r\in\{p,...,p^{2}-1\}}\alpha_{r}(p)$

Proof.

By the previous theorem we have

[TABLE]

for each $t\in\mathbb{N}$. After division by $p^{\alpha_{r}(p)}$, where $r=n\pmod{p^{2}}$, we get

[TABLE]

Since $\alpha(p)-\alpha_{r}(p)\geq 0$, we thus obtain

[TABLE]

as we wanted to prove. ∎

Corollary 4.9**.**

The sequence

[TABLE]

is periodic of period $16$.

Proof.

Since $2\in\mathcal{A}$ and $\alpha(2)=2$ (see for example [1, Theorem 4.1]), by the previous corollary we know that the sequence $\left(\frac{H_{2}(n)}{2^{\nu_{2}(H_{2}(n))}}\pmod{4}\right)_{n\in\mathbb{N}}$ is periodic with period $2^{9}$. Hence it suffices to check the values $\frac{H_{2}(n)}{2^{\nu_{2}(H_{2}(n))}}$ modulo $4$ for $n\in\{0,...,511\}$ one by one. ∎

In case of $p\not\in\mathcal{A}$ we predict that the sequence $\left(\frac{H_{p}(n)}{p^{\nu_{p}(H_{p}(n))}}\pmod{p^{w}}\right)_{n\in\mathbb{N}}$ is not periodic for any $w\in\mathbb{N}_{+}$ but proving this fact seems to be out of reach for us.

5. The behaviour of the $p$-adic valuation of $H_{d}(n)$, where $p>d$

On the beginning of the paper we marked that if $p$ is a prime number $<d$, then $\nu_{p}(H_{d}(n))=0$ for each $n\in\mathbb{N}$. The problem of computation of the $p$-adic valuations of the numbers $H_{d}(n)$ in case $p=d$ was considered in the previous section and it was studied in several publications. In the opposition to this fact the question concerning the computation of the $p$-adic valuations of the numbers $H_{d}(n)$, where $p>d$, is almost unexplored. It was first considered by Amdeberhan and Moll in [1]. According to results on periodicity of the sequence $(H_{2}(n)\pmod{c})_{n\in\mathbb{N}}$ they claimed that if $p$ is an odd prime number not dividing the values $H_{2}(n)$ for $n\in\{0,...,p-1\}$, then $\nu_{p}(H_{d}(n))=0$ for each $n\in\mathbb{N}$. The situation is more complicated if $p$ divides some of those values. It happens for $p=5$. Based on numerical computations they stated a conjecture which equivalent version is as follows

Conjecture 5.1**.**

If $p$ is an odd prime number such that $p\mid H_{2}(n)$ for some $n\in\{0,...p-1\}$ then for each $k\in\mathbb{N}_{+}$ there exists a unique $n_{k}$ modulo $p^{k}$ such that $p^{k}\mid H_{2}(n)$ if and only if $n\equiv n_{k}\pmod{p^{k}}$.

The above conjecture is not true for two reasons. The first reason is that there exist prime numbers $p$ and positive integers $n_{1}$ such that $\nu_{p}(H_{2}(n))=1$ for each $n\equiv n_{1}\pmod{p}$, for example $(p,n_{1})=(19,6)$. The second one is that for some prime numbers $p$, for example $59$ and $61$, there exist more than one value $n_{1}$ modulo $p$ such that $p\mid H_{2}(n)$ for $n\equiv n_{1}\pmod{p}$.

The aim of this section is to shed some light on the behaviour of $\nu_{p}(H_{d}(n))$ in the case when $p>d$.

We use the exact formula for the number $H_{d}(n)$ and make some modifications:

[TABLE]

The above notation suggests us to define the function $f_{d}(x)=\sum_{k=0}^{+\infty}\frac{(x)_{(dk)}}{k!d^{k}}$, $x\in\mathbb{Z}_{p}$. This function is well defined for each $x\in\mathbb{Z}_{p}$ as

[TABLE]

where the last value in the above inequalities tend to $+\infty$ when $k\rightarrow+\infty$. The following three lemmas show that

• •

$f_{d}$ is a $p$-adic differentiable function,

• •

there exists a function $g_{d}:\mathbb{Z}_{p}\times p\mathbb{Z}_{p}\rightarrow\mathbb{Q}_{p}$ such that $f_{d}(x+h)=f_{d}(x)+hf^{\prime}_{d}(x)+h^{2}g_{d}(x,h)$ for any $x\in\mathbb{Z}_{p}$, $h\in p\mathbb{Z}_{p}$ and $g_{d}(x,h)\in\mathbb{Z}_{p}$ if only $d\geq 3$ or $p\mid f_{2}(x)$,

• •

$f^{\prime}_{d}(x_{1})\equiv f^{\prime}_{d}(x_{2})\pmod{p^{r}}$ if $x_{1}\equiv x_{2}\pmod{p^{r}}$.

By the above facts we will be able to describe behaviour of the $p$-adic valuations of numbers $H_{d}(n)$, $n\in\mathbb{N}$, using classical Hensel’s lemma.

Lemma 5.2**.**

The function $f_{d}$ is differentiable and $f^{\prime}_{d}(x)=\sum_{k=1}^{+\infty}\sum_{j=0}^{dk-1}\frac{(x)_{(j)}(x-j-1)_{(dk-j-1)}}{k!d^{k}}\in\mathbb{Z}_{p}$ for each $x\in\mathbb{Z}_{p}$.

Proof.

We compute the derivative from the very definition:

[TABLE]

where we put $\sum_{0\leq j_{1}<...<j_{t}\leq dk-1}\frac{(x)_{(dk)}}{(x-j_{1})\cdot...\cdot(x-j_{t})}=(x)_{(dk)}$ for $t=0$. We estimate the $p$-adic valuation of $\frac{h^{t-2}(x)_{(dk)}}{k!d^{k}(x-j_{1})\cdot...\cdot(x-j_{t})}$ from below. We will do this by estimating the $p$-adic valuation of the product $(x-j_{1})\cdot...\cdot(x-j_{dk-l})$, where $0\leq j_{1}<...<j_{dk-l}\leq dk-1$, from below by the number of factors $x-j_{1},...,x-j_{dk-l}$ divisible by $p$. This number is at least equal to $\left\lfloor\frac{dk}{p}\right\rfloor-l$. Indeed, we have at least $\left\lfloor\frac{dk}{p}\right\rfloor$ numbers divisible by $p$ among all the $p$-adic integers $x-dk+1,x-dk+2,...,x$ and we cancel at most $l$ numbers divisible by $p$ from them. Hence,

[TABLE]

where we assumed that $\nu_{p}(h)\geq 1$ and use the Legendre formula $\nu_{p}(k!)=\frac{k-s_{p}(k)}{p-1}$. Here, $s_{p}(k)$ is the sum of digits of the number $k$ written in the (unique) $p$-ary expansion. Hence, the $p$-adic valuation of

[TABLE]

is at least $-2$ and it tends to $+\infty$ when $k\rightarrow+\infty$. Thus, the series

[TABLE]

is convergent and its $p$-adic valuation is at least $-2$. We infer that

[TABLE]

when $h\rightarrow 0$. This is why $f^{\prime}_{d}(x)=\sum_{k=1}^{+\infty}\sum_{j=0}^{dk-1}\frac{(x)_{(dk)}}{k!d^{k}(x-j)}=\sum_{k=1}^{+\infty}\sum_{j=0}^{dk-1}\frac{(x)_{(j)}(x-j-1)_{(dk-j-1)}}{k!d^{k}}$. This series is convergent, as

[TABLE]

when $k\rightarrow+\infty$, where we used the fact that $j,dk-j-1<dk$, so $j,dk-j-1$ have at most $\lfloor\log_{p}dk\rfloor+1$ $p$-ary digits. Moreover,

[TABLE]

as at least one of the numbers $j,dk-j-1$ is greater than or equal to $k$. Thus the $p$-adic valuation of $\sum_{k=1}^{+\infty}\sum_{j=0}^{dk-1}\frac{(x)_{(j)}(x-j-1)_{(dk-j-1)}}{k!d^{k}}$ is non-negative. ∎

Lemma 5.3**.**

For each $x,h\in\mathbb{Z}_{p}$ with $\nu_{p}(h)\geq 1$ we have $f_{d}(x+h)=f_{d}(x)+hf^{\prime}_{d}(x)+h^{2}g_{d}(x,h)$, where $g_{d}(x,h)=\sum_{l=2}^{+\infty}x^{l-2}\sum_{k=\left\lceil\frac{l}{d}\right\rceil}^{+\infty}\frac{1}{k!d^{k}}\sum_{0\leq j_{1}<...<j_{dk-l}\leq dk-1}(x-j_{1})\cdot...\cdot(x-j_{dk-l})$. Moreover, if $d\geq 3$ or $\nu_{p}(f_{2}(x))\geq 1$, then $g_{d}(x,h)\in\mathbb{Z}_{p}$.

Proof.

Let us fix $x,h\in\mathbb{Z}_{p}$ with $\nu_{p}(h)\geq 1$. We then have:

[TABLE]

For the change of the order of summation, we will show that

[TABLE]

Let us estimate the $p$-adic valuation of the number $\sum_{0\leq j_{1}<...<j_{dk-l}\leq dk-1}(x-j_{1})\cdot...\cdot(x-j_{dk-l})$ from below. We have the inequality

[TABLE]

Since $p>d\geq 2$, we thus have

[TABLE]

Then we change summation in the last expression in (9) and get the following:

[TABLE]

where $g_{d}(x,h)=\sum_{l=2}^{+\infty}h^{l-2}\sum_{k=\left\lceil\frac{l}{d}\right\rceil}^{+\infty}\frac{1}{k!d^{k}}\sum_{0\leq j_{1}<...<j_{dk-l}\leq dk-1}(x-j_{1})\cdot...\cdot(x-j_{dk-l})$. Now, we are left with the proof that $\nu_{p}(g_{d}(x,h))\geq 0$ provided that $\nu_{p}(f_{d}(x))\geq 1$ or $d\geq 3$. If $k<p$, where $d\geq 2$ is arbitrary, then, of course, $\nu_{p}\left(\frac{h^{l-2}\sum_{0\leq j_{1}<...<j_{dk-l}\leq dk-1}(x-j_{1})\cdot...\cdot(x-j_{dk-l})}{k!d^{k}}\right)\geq 0$. By (10) we know that

[TABLE]

We check that $\frac{[(d-1)(p-1)-1]k+ps_{p}(k)}{p(p-1)}-2\geq\frac{[2(p-1)-1](p+1)}{p(p-1)}-2=\frac{(2p-3)(p+1)}{p(p-1)}-2\geq 0$ for $p>d\geq 3$ and $k\geq p+1$. If $d\geq 3$ and $k=p$, then either $l\geq 3$ and then $\nu_{p}(h^{l-2})\geq l-2\geq 1=\nu_{p}(p!)$ or $l=2$ an then in each product of the form $(x-j_{1})\cdot...\cdot(x-j_{dk-2})$, where $0\leq j_{1}<...<j_{dk-2}\leq dk-1$ there is a factor with the $p$-adic valuation at least equal to $1$. Hence, $\nu_{p}\left(\frac{h^{l-2}\sum_{0\leq j_{1}<...<j_{dk-l}\leq dk-1}(x-j_{1})\cdot...\cdot(x-j_{dk-l})}{k!d^{k}}\right)\geq 0$ for $d\geq 3$ and $k=p$. If $d=2$, then $\frac{[(d-1)(p-1)-1]k+ps_{p}(k)}{p(p-1)}-2\geq\frac{[(p-1)-1](2p+4)}{p(p-1)}-2=\frac{(p-2)(2p+4)}{p(p-1)}-2\geq 0$ for $p\geq 5$ and $k\geq 2p+4$ (we do not need to consider the case of $p=3$ as $3\nmid H_{2}(n)$ for any $n\in\mathbb{N}$). If $d=2$, $p\leq k\leq 2p-1$ and $l\geq 3$, then $\nu_{p}(h^{l-2})\geq l-2\geq 1=\nu_{p}(k!)$. Hence, $\nu_{p}\left(\frac{h^{l-2}\sum_{0\leq j_{1}<...<j_{dk-l}\leq dk-1}(x-j_{1})\cdot...\cdot(x-j_{dk-l})}{k!d^{k}}\right)\geq 0$ for $d=2$, $p\leq k\leq 2p-1$ and $l\geq 3$. If $d=2$ and $2p\leq k\leq 2p+3$, where $p\geq 5$, then either $l\geq 4$ and then $\nu_{p}(h^{l-2})\geq l-2\geq 2=\nu_{p}(k!)$ or $l\in\{2,3\}$ and then in each product of the form $(x-j_{1})\cdot...\cdot(x-j_{2k-l})$, where $0\leq j_{1}<...<j_{2k-l}\leq 2k-1$ there are at least $4-l$ factors with the $p$-adic valuation at least equal to $1$. Hence, $\nu_{p}(h^{l-2}\sum_{0\leq j_{1}<...<j_{2k-l}\leq dk-1}(x-j_{1})\cdot...\cdot(x-j_{dk-l}))\geq l-2+4-l=2=\nu_{p}(k!)$. We left with the case of $d=2$, $p\leq k\leq 2p-1$ and $l=2$. Let us assume that $\nu_{p}(f_{2}(x))\geq 1$ and write $r=x\pmod{p}$. We then compute modulo $p$:

[TABLE]

Thus,

[TABLE]

This ends the proof of the fact that $g_{d}(x,h)\in\mathbb{Z}_{p}$ on condition that $\nu_{p}(f_{d}(x))\geq 1$ or $d\geq 3$. ∎

Lemma 5.4**.**

Let $x,h\in\mathbb{Z}_{p}$ with $\nu_{p}(h)\geq 1$. If $d\geq 3$ or $\nu_{p}(f_{2}(x))\geq 1$, then $f^{\prime}_{d}(x+h)\equiv f^{\prime}_{d}(x)\pmod{p^{\nu_{p}(h)}}$.

Proof.

By the previous lemma we can write

[TABLE]

After adding the above two equalities and simplifying we obtain

[TABLE]

Since $d\geq 3$ or $\nu_{p}(f_{2}(x))\geq 1$, by the previous lemma we have that $\nu_{p}(g_{d}(x,h)),\nu_{p}(g_{d}(x+h,-h))\geq 0$. Thus, $p^{2\nu_{p}(h)}\mid h^{2}(g_{d}(x,h)+g_{d}(x+h,-h))$, which implies that $p^{2\nu_{p}(h)}\mid h(f^{\prime}_{d}(x)-f^{\prime}_{d}(x+h))$. Hence, $p^{\nu_{p}(h)}\mid f^{\prime}_{d}(x)-f^{\prime}_{d}(x+h)$, or equivalently, $f^{\prime}_{d}(x+h)\equiv f^{\prime}_{d}(x)\pmod{p^{\nu_{p}(h)}}$. ∎

At this moment we are prepared to state the theorem on qualitative description of the sequence $(\nu_{p}(H_{d}(n))_{n\in\mathbb{N}}$.

Theorem 5.5**.**

Let $d$ be a positive integer at least equal to $2$, $p>d$ be a prime number and $k$ be a positive integer. Assume that $H_{d}(n_{k})\equiv 0\pmod{p^{k}}$ for some integer $n_{k}$. Then the number of solutions $n$ modulo $p^{k+1}$ of the congruence $H_{d}(n)\equiv 0\pmod{p^{k+1}}$, satisfying the condition $n\equiv n_{k}\pmod{p^{k}}$, is equal to:

• •

$1$, when $f^{\prime}_{d}(n_{k})\not\equiv 0\pmod{p}$;

• •

[math], when $f^{\prime}_{d}(n_{k})\equiv 0\pmod{p}$ and $H_{d}(n_{k})\not\equiv 0\pmod{p^{k+1}}$;

• •

$p$, when $f^{\prime}_{d}(n_{k})\equiv 0\pmod{p}$ and $H_{d}(n_{k})\equiv 0\pmod{p^{k+1}}$.

In particular, if $p\mid H_{d}(n_{1})$ for some $n_{1}\in\mathbb{N}$ and $\nu_{p}(f^{\prime}_{d}(n_{1}))=0$, then for each $k\in\mathbb{N}_{+}$ there exists a unique value $n_{k}$ modulo $p^{k}$ such that if $n\equiv n_{1}\pmod{p}$, then $p^{k}\mid H_{d}(n)$ if and only if $n\equiv n_{k}\pmod{p^{k}}$. In other words there exists a unique $p$-adic integer $b\equiv n_{1}\pmod{p}$ such that $\nu_{p}(H_{d}(n))=\nu_{p}(n-b)$ for each non-negative integer $n\equiv n_{1}\pmod{p}$.

Proof.

We have $H_{d}(n)=f_{d}(n)$ for each $n\in\mathbb{N}$. Moreover, we know that $f_{d}(x+h)=f_{d}(x)+hf^{\prime}_{d}(x)+h^{2}g_{d}(x,h)$ for $x,h\in\mathbb{Z}_{p}$ with $\nu_{p}(h)\geq 1$. Furthermore, if $d\geq 3$ or $\nu_{p}(f_{2}(x))\geq 1$, then $g_{d}(x,h)\in\mathbb{Z}_{p}$ and $f^{\prime}_{d}(x_{1})\equiv f^{\prime}_{d}(x_{2})\pmod{p}$ for congruent $p$-adic integers $x_{1},x_{2}$ modulo $p$. These all facts make the proof of our theorem exactly the same as the proof of classical Hensel’s lemma from [9, p. 44]. ∎

Remark 5.6**.**

Let us compute $f^{\prime}_{d}(n)\pmod{p}$ for $n\in\mathbb{N}$:

[TABLE]

as $\frac{(dk-n-1)!}{k!}={dk-n-1\choose k}((d-1)k-n-1)!$ and $p\mid((d-1)k-n-1)!$ if $p\leq(d-1)k-n-1$. That is a way to compute the value $f^{\prime}_{d}(n)\pmod{p}$ by adding only finitely many summands.

However, in many cases, having $d\in\mathbb{N}_{\geq 2}$, a prime number $p$ and $n_{1}\in\{d,...,p-1\}$ such that $p\mid H_{d}(n_{1})$ (recall that $H_{d}(n)=1$ for $n\in\{0,...,d-1\}$), we do not need to compute $f^{\prime}_{d}(n)\pmod{p}$. Instead of this, it suffices to compute $\nu_{p}(H_{d}(n_{1}))$. If $\nu_{p}(H_{d}(n_{1}))=1$, then we check $p$-adic valuations of numbers $H_{d}(n_{1}+pt)$ for $t\in\{1,...,p-1\}$. If $\nu_{p}(H_{d}(n_{1}+pt))\geq 2$ for some $t\in\{1,...,p-1\}$ then for each $k\in\mathbb{N}_{+}$ there exists a unique value $n_{k}$ modulo $p^{k}$ such that if $n\equiv n_{1}\pmod{p}$ then $p^{k}\mid H_{d}(n)$ if and only if $n\equiv n_{k}\pmod{p^{k}}$. Otherwise, $\nu_{p}(H_{d}(n))=1$ for any $n\equiv n_{1}\pmod{p}$. If $\nu_{p}(H_{d}(n_{1}))\geq 2$ then we only check $p$-adic valuation of the number $H_{d}(n_{1}+p)$. If $\nu_{p}(H_{d}(n_{1}+p))=1$ then for each $k\in\mathbb{N}_{+}$ there exists a unique value $n_{k}$ modulo $p^{k}$ such that if $n\equiv n_{1}\pmod{p}$ then $p^{k}\mid H_{d}(n)$ if and only if $n\equiv n_{k}\pmod{p^{k}}$. Otherwise, $\nu_{p}(H_{d}(n))\geq 2$ for any $n\equiv n_{1}\pmod{p}$.**

Remark 5.7**.**

We found all the triples $(d,p,n_{1})$ for $d\in\{2,3,4,5\}$, first $25$ prime numbers $p$ and numbers $n_{1}\in\{d,...,p-1\}$ such that $p\mid H_{d}(n_{1})$. We checked the behaviour of the $p$-adic valuations of numbers $H_{d}(n)$ where $n\equiv n_{1}\pmod{p}$. The only triples $(d,p,n_{1})$ such that $\nu_{p}(H_{d}(n))=1$ for all $n\equiv n_{1}\pmod{p}$ are $(2,19,6)$, $(3,13,7)$. For any other triple and a positive integer $k$ we have the existence of a unique $n_{k}$ modulo $p^{k}$ such that if $n\equiv n_{1}\pmod{p}$ then $p^{k}\mid H_{d}(n)$ if and only if $n\equiv n_{k}\pmod{p^{k}}$.**

6. Properties of polynomials attained during differentiation the exponential generating function of the sequence $(H_{d}(n))_{n\in\mathbb{N}}$

Let $m\in\mathbb{N}$ and for $m$-th derivative of $\mathcal{H}_{d}(x)$ we write $\mathcal{H}_{d}^{(m)}(x)=W_{d,m}(x)\mathcal{H}_{d}(x)$. We have $W_{d,0}(x)=1$ and due to the identity

[TABLE]

we immediately deduce the recurrence relation

[TABLE]

We summarize the basic properties of the sequence $(W_{d,m}(x))_{m\in\mathbb{N}}$ in the following:

Theorem 6.1**.**

The following properties hold:

1. (1)

$W_{d,n}(x)$* is unitary polynomial with non-negative integer coefficients and $\operatorname{deg}W_{d,n}(x)=(d-1)n$;* 2. (2)

$W_{d,n}(0)=H_{d}(n)$; 3. (3)

For $d\in\mathbb{N}_{\geq 2}$ and $m\in\mathbb{N}$ let us write

[TABLE]

If $d\in\mathbb{N}_{\geq 3}$ is an odd number then

[TABLE] 4. (4)

The exponential generating function for the sequence $(W_{d,n}(x))_{n\in\mathbb{N}}$ takes the form

[TABLE]

Proof.

(1) This is clear. Because $W_{d,0}(x)=1$ is a polynomial and on the right hand side of the recurrence $W_{d,m}(x)=W_{d,m-1}^{\prime}(x)+(1+x^{d-1})W_{d,m-1}(x)$, $m\in\mathbb{N}_{+}$, we have only addition and multiplication then simple induction gives the result. Similarly simple induction shows the equality $\operatorname{deg}W_{d,m}(x)=(d-1)m$.

(2) Because $\mathcal{H}_{d}(0)=1$ then $\mathcal{H}_{d}^{(m)}(0)=W_{d,m}(0)$ and thus $W_{d,m}(0)$ is just the coefficient near $x^{m}/m!$ in the power series expansion of $\mathcal{H}_{d}(x)$ in the neighborhood of the point $x=0$. Hence the result.

(3) The stated identity is a simple consequence of the definition of the sequence $(W_{d,m}(x))_{m\in\mathbb{N}}$. Indeed, in the case of odd $d$ we have $\mathcal{H}_{d}(x)^{-1}=\mathcal{H}_{d}(-x)$. Let us also note that

[TABLE]

In consequence, from the identity

[TABLE]

we see that the coefficient near $x^{n}$ in the power series expansion of the function $\mathcal{H}_{d}^{(m)}(x)\mathcal{H}_{d}(-x)$ is just the coefficient of $W_{d,m}(x)$ near $x^{n}$. But in this case the $n$-th coefficient is exactly the sum stated in the statement of our result.

(4) It is clear that the function $\mathcal{H}_{d}(x)W_{d,n}(x)$ is the coefficient near $t^{n}/n!$ in the power series expansion of the function $\mathcal{H}_{d}(x)\mathcal{W}_{d}(x,t)$ in the neighborhood of the point $t=x$. Indeed,

[TABLE]

Multiplying both sides by $\mathcal{H}_{d}(x)^{-1}$ we get

[TABLE]

and hence the result.

∎

As an immediate consequence of the shape of exponential generating function for $(W_{d,n}(x))_{n\in\mathbb{N}}$ we get the following:

Corollary 6.2**.**

The sequence $(W_{d,n}(x))_{n\in\mathbb{N}}$ satisfies the following recurrence relation: $W_{d,n}(x)=0$ for $n<0$, $W_{d,0}(x)=1$ and

[TABLE]

for $n\geq 1$.

Proof.

By comparing the coefficients near $t^{n}$ in the identity

[TABLE]

we get the equality

[TABLE]

Multiplying both sides by $n!$, writing $n!/(n-i)!$ as $(n)_{(i-1)}$ and replacing $n$ by $n-1$ and $i$ by $j-1$ we get the result (with the convention $W_{d,n}(x)\equiv 0$ for $n<0$). ∎

Remark 6.3**.**

In the proof of Corollary 6.2 we proved recurrence relation for the sequence $(W_{d,n}(x))_{n\in\mathbb{N}}$ by manipulating of exponential generating functions. One can also consider the (formal) ordinary generating function of the sequence $(W_{d,n}(x))_{n\in\mathbb{N}}$ and get a relation of a different kind. Indeed, it is an easy exercise to prove that the (formal) power series $\mathcal{S}_{d}(x,t)=\sum_{n=0}^{\infty}W_{d,n}(x)t^{n}$ satisfies the differential equation

[TABLE]

Multiplying both sides of the above identity by $(1-(1+x^{d-1})t)^{-1}$ and comparing coefficients near $t^{n}$ we easily deduce the following relation

[TABLE]

This gives us an expression of $W_{d,n}(x)$ in terms of the sequence $(W_{d,n}^{\prime}(x))_{n\in\mathbb{N}}$. **

Remark 6.4**.**

Let us note that the sequence $(W_{2,m}(x))_{m\in\mathbb{N}}$ was implicitly studied by Amdeberhan and Moll (Corollary 2.6 in [1]). Although the mentioned authors did not find recurrence relation for this sequence they were able to get the closed form

[TABLE]

From our result we get $W_{2,0}(x)=1,W_{2,1}(x)=1+x$ and for $n\geq 2$ we have

[TABLE]

This allows us to deduce the following nice identity:

[TABLE]

Indeed, taking $x=-1$ in the recurrence relation for $W_{2,n}(x)$ we get $W_{2,n}(-1)=(n-1)W_{2,n-2}(-1)$. Because $W_{2,0}(-1)=1$ and $W_{2,1}(-1)=0$ by a simple iteration of the above recurrence we get the formula presented above.

Let us also note that the value of $W_{2,n}(x)$ at $x=1$ has striking combinatorial interpretation. Indeed, the sequence $(W_{2,n}(1))_{n\in\mathbb{N}}$ satisfies the recurrence relation: $W_{2,0}(1)=1,W_{2,1}(1)=2$ and

[TABLE]

In particular, $(W_{2,n}(1))_{n\in\mathbb{N}}$ is a binomial transform of the sequence $(H_{2}(n))_{n\in\mathbb{N}}$. Moreover, as was observed by Donaghey in [4], this sequence enumerates the general switchboard problem, i.e., it enumerates the states of a telephone exchange with $n$ subscribers which is provided with means to connect subscribers singly to outside lines and in pairs internally (no conference circuits). **

The last results of this section are devoted to the behaviour of sequences $(W_{d,m}(x)\pmod{c})_{m\in\mathbb{N}}$ where $c=d-1$ or $c=d=p$ is a prime number.

Theorem 6.5**.**

The following congruence holds for each $d\geq 2$ and $m\in\mathbb{N}$:

[TABLE]

In particular, if $p$ is a prime number then

[TABLE]

for any $m\in\mathbb{N}$.

Proof.

We proceed by induction on $m\in\mathbb{N}$. If $m=0$ then $W_{d,0}(x)=1$, hence the statement of our theorem is true. If $m>0$ then we use Corollary 6.2 and the induction hypothesis for $m-1$ and get

[TABLE]

∎

Theorem 6.6**.**

For each prime $p$ we have $W_{p,p}(x)\equiv x^{p(p-1)}\pmod{p}$.

Proof.

We easily check that we have $W_{2,2}(x)=x^{2}+2x+2$, so assertion holds for $p=2$. Now we assume that $p$ is an odd prime number. We will show that all the coefficients of the polynomial $W_{p,p}(x)$ except for the leading one are divisible by $p$. We use the formula

[TABLE]

from the third part of the statement of Theorem 6.1. It suffices to prove that for each $n\in\{0,...,p(p-1)-1\}$ and $k\in\{0,...,n\}$ we have $\nu_{p}\left(\frac{H_{p}(p+k)}{k!}\cdot\frac{H_{p}(n-k)}{(n-k)!}\right)\geq 1$. By Corollary 4.5, $\nu_{p}(H_{p}(p+k))\geq 1+\left\lfloor\frac{k}{p}\right\rfloor$ and $\nu_{p}(H_{p}(n-k))\geq\left\lfloor\frac{n-k}{p}\right\rfloor$. On the other hand, it is easy to see that $\nu_{p}(k!)=\left\lfloor\frac{k}{p}\right\rfloor$ and $\nu_{p}((n-k)!)=\left\lfloor\frac{n-k}{p}\right\rfloor$. Summing up the above observations, we get $\nu_{p}\left(\frac{H_{p}(p+k)}{k!}\cdot\frac{H_{p}(n-k)}{(n-k)!}\right)\geq 1$ and the statement of our corollary follows for any odd prime $p$. ∎

Theorem 6.7**.**

The sequence

[TABLE]

is periodic and the length of the period is $p$.

In particular

[TABLE]

Proof.

First, we prove by induction on $m\in\mathbb{N}$ that

[TABLE]

The above congruence is satisfied for $m=0$ by the Theorem 6.6. Assume now that (12) holds for some $m\in\mathbb{N}$ and we will show that it holds for $m+1$. By (11) we get

[TABLE]

Now we have congruence (12) proved. Let us fix $m\in\mathbb{N}$ and write $m=jp+i$. Then, using (12) $j$ times, we get

[TABLE]

After multiplication by $x^{p(1-p)j}$ and substitution $j=\left\lfloor\frac{m}{p}\right\rfloor$ and $i=m\pmod{p}$ we obtain

[TABLE]

and get the result ∎

7. Divisors of numbers $H_{d}(n)$

In this section we study various properties of the numbers $H_{d}(n)$ and $H_{d}(n)-1$. We are interested in prime divisors and various GCD properties.

7.1. Prime divisors of numbers $H_{d}(n)$

Let us denote $\mathbb{P}_{d}=\{p\in\mathbb{P}:p\mid H_{d}(n)\mbox{ for some }n\in\mathbb{N}\}$.

Theorem 7.1**.**

For each $d\in\mathbb{N}_{\geq 2}$ the set $\mathbb{P}_{d}$ is infinite.

Proof.

Assume by the contrary that $p_{1}<...<p_{s}$ are all the elements of the set $\mathbb{P}_{d}$. We consider two cases. The first case is when $d$ is a composite number. We put $P=p_{1}\cdot...\cdot p_{s}$. By Corollary 3.8 we know that the sequence $(H_{d}(n)\pmod{P})_{n\in\mathbb{N}}$ is periodic of period $P$, as $2<d$ and thus $2$ is not a divisor of any number $H_{d}(n)$. In particular, the numbers $H_{d}(Pm)$, $m\in\mathbb{N}$, are congruent to $1$ modulo $P$. Hence these numbers have no prime divisors. This combined with the fact that $H_{d}(Pm)>0$ implies $H_{d}(Pm)=1$ for any $m\in\mathbb{N}$. However, this is a contradiction with the fact that the sequence $(H_{d}(n))_{n\in\mathbb{N}}$ is an ultimately strictly increasing sequence of positive integers.

The second case is when $d$ is a prime number. Then $p_{1}=d=H_{d}(d)$. We put $P=p_{1}^{2}\cdot p_{2}\cdot...\cdot p_{s}$ and $Q=p_{2}\cdot...\cdot p_{s}$. By Corollary 3.8 we know that the sequence $(H_{d}(n)\pmod{Q})_{n\in\mathbb{N}}$ is periodic of the period $Q$, as $d$ is a prime number not dividing $Q$. In particular, since $Q\mid P$, we have $H_{d}(Pm)\equiv H_{d}(Pm+1)\equiv 1\pmod{p_{i}}$ for $m\in\mathbb{N}$ and $i\in\{2,...,s\}$. According to Corollary 4.5, $\nu_{p_{1}}(H_{d}(Pm))=\nu_{p_{1}}(H_{d}(Pm+1))=Qm(p_{1}-1)$. Since $H_{d}(Pm)>0$ and $p_{1},...,p_{s}$ are all possible divisors of the numbers $H_{d}(n)$, $n\in\mathbb{N}$, thus $H_{d}(Pm)=H_{d}(Pm+1)=p_{1}^{Qm(p_{1}-1)}$ for any $m\in\mathbb{N}$. However, $H_{d}(Pm+1)=H_{d}(Pm)+(Pm)_{(d-1)}H_{d}(Pm-d+1)>H_{d}(Pm)$ for $m\geq\frac{d-1}{P}$ - a contradiction. ∎

Conjecture 7.2**.**

For each $d\in\mathbb{N}_{\geq 2}$ the set $\mathbb{P}\backslash\mathbb{P}_{d}$ is infinite and its asymptotic density in $\mathbb{P}$ is equal to $\frac{1}{e}$.

The following heuristic reasoning allows us to claim the second statement in the conjecture above. If we fix a prime number $p$ and randomly choose a sequence $(a_{n})_{n\in\mathbb{N}}$ such that the sequence $(a_{n}\pmod{p})_{n\in\mathbb{N}}$ has the period $p$, then the probability that $p$ does not divide any term of this sequence is equal to $\left(1-\frac{1}{p}\right)^{p}$. The probability tends to $\frac{1}{e}$ with $p\rightarrow+\infty$. Note that $p>d$ belongs to the set $\mathbb{P}\backslash\mathbb{P}_{d}$ if and only if $p$ does not divide any number $H_{d}(n)$ for $n\in\{d,...,p-1\}$. Moreover, the sequence $(H_{d}(n)\pmod{p})_{n\in\mathbb{N}}$ is periodic of the period $p$. Therefore we suppose that the probability that $p\in\mathbb{P}\backslash\mathbb{P}_{d}$ equals to $\left(1-\frac{1}{p}\right)^{p-d}$. Thus, this probability tends to $\frac{1}{e}$ with $p\rightarrow+\infty$ and hence the asymptotic density of the set $\mathbb{P}\backslash\mathbb{P}_{d}$ in the set $\mathbb{P}$ is expected to be equal to $\frac{1}{e}$.

Remark 7.3**.**

We performed small numerical search in order to check whether our expectations are likely to be true. More precisely, for $d\in\{2,\ldots,10\},k\leq 4000$ and $n\in\{d,\ldots,p_{k}\}$ we computed the number of primes $p_{i}$ such that $p_{i}|H_{d}(n)$. In the table below we present the result of our computations.

[TABLE]

Table 1. The number of integers $k\leq 4000$ such that $H_{d}(n)\equiv 0\pmod{p_{k}}$ for some positive integer $n\leq p_{k}$ and $d\in\{2,\ldots,10\}$.

The numbers in the last row in the table above are quite close to the number $1-1/e\simeq 0.63212$, which is the conjectured density of the set $\mathbb{P}_{d}$ in the set $\mathbb{P}$. **

7.2. Greatest common divisors of numbers $H_{d}(n)-1$ and $n$

Performing numerical computations, we observed a quite interesting formula for the greatest common divisor of the number $H_{d}(n)$ and its index $n$.

Theorem 7.4**.**

Let $d,n\in\mathbb{N}$ with $d\geq 2$. Then the number $\text{GCD}(H_{d}(n)-1,n)$ is equal to

• •

$n$* if $d$ is a composite number not equal to $4$ or $d=4$ and $\nu_{2}(n)\neq 2$;*

• •

$\frac{n}{2}$* if $d=4$ and $\nu_{2}(n)=2$;*

• •

$\frac{n}{d^{\nu_{d}(n)}}$* if $d$ is a prime number.*

Proof.

At first, let us prove the theorem for $d$ composite. Let us note the equality:

[TABLE]

For $d\neq 4$ it suffices to show that $\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}$ is an integer for each $k\in\left\{1,...,\left\lfloor\frac{n}{d}\right\rfloor\right\}$. If $k=1$, then

[TABLE]

as $d$ is a composite number greater than $4$. If $k=2$ then

[TABLE]

where $\frac{(d-1)!}{d}$ is an integer and $2$ divides some of the $d-1$ factors $d+1,...,2d-1$ as $d\geq 6$. Assume that $k\geq 3$. In order to prove that $\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}$ is an integer, we will show that $\nu_{p}\left(\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}\right)\geq 0$ for each prime number $p$. Let us write:

[TABLE]

We see that if $\nu_{p}(d)=0$ then $\nu_{p}\left(\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}\right)\geq 0$. Thus, assume now that $p\mid d$. Then, we estimate $\nu_{p}((dk-1)\cdot...\cdot(k+1))$ from below by the number of multiplicities of $p$ among the integers from $k+1$ to $dk-1$. This number is at least equal to $\left\lfloor\frac{(d-1)k-1}{p}\right\rfloor$. Hence,

[TABLE]

If $\nu_{p}(d)\geq 3$ or $p>2$ and $\nu_{p}(d)\geq 2$ then $d\geq p^{\nu_{p}(d)}$. Thus the last expression in (14) is bounded from below by $k(p^{\nu_{p}(d)-1}-\nu_{p}(d))-\frac{k+p+1}{p}$. We have the following chain of equivalences:

[TABLE]

The left hand side of the last inequality is at least equal to $1$. Since $k\geq 3$ and $p\in\mathbb{P}$ then $\frac{1}{p}+\frac{1}{k}+\frac{1}{kp}\leq 1$. In consequence $\nu_{p}\left(\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}\right)\geq 0$ for any prime $p$ such that $\nu_{p}(d)\geq 3$ or $p>2$ and $\nu_{p}(d)\geq 2$.

If $\nu_{p}(d)=1$ or $p=2$ and $\nu_{2}(d)=2$ then $d\geq 2p^{\nu_{p}(d)}$. Thus the last expression in (14) is bounded from below by $k(2p^{\nu_{p}(d)-1}-\nu_{p}(d))-\frac{k+p+1}{p}$. We have the following chain of equivalences:

[TABLE]

The left hand side of the last inequality is at least equal to $1$ and the right hand side, as we have seen earlier, is at most equal to $1$. Validity of the last inequality implies that $\nu_{p}\left(\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}\right)\geq 0$ for any prime $p$ such that $\nu_{p}(d)=1$ or $p=2$ and $\nu_{2}(d)=2$.

We have just proven that $\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}$ is an integer for each $k\in\left\{1,...,\left\lfloor\frac{n}{d}\right\rfloor\right\}$. Thus $\sum_{k=1}^{\left\lfloor\frac{n}{d}\right\rfloor}{n-1\choose dk-1}\cdot\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}\in\mathbb{Z}$ and, as a result, $n\mid H_{d}(n)-1$ in the case of $d>4$ composite.

Let us consider now the case of $d=4$. By (13) we know that $H_{4}(n)-1=n\sum_{k=1}^{\left\lfloor\frac{n}{4}\right\rfloor}{n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}$. If $p$ is an odd prime number, then $\nu_{p}\left(\frac{(4k-1)!}{k!4^{k}}\right)=\nu_{p}((4k-1)_{(3k-1)})\geq 0$. We have

[TABLE]

In the above computation we used the Legendre formula $\nu_{2}(m!)=m-s_{2}(m)$ and its corollary $\nu_{2}\left(m\choose l\right)=s_{2}(l)+s_{2}(m-l)-s_{2}(m)$ for $0\leq l\leq m$. The value $k-2-\nu_{2}(k)$ is non-negative for $k\geq 3$ and equal to $-1$ for $k\in\{1,2\}$. Hence, the value of ${n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}$ is an integer for $k\geq 3$. Meanwhile for $k\in\{1,2\}$ we compute $\nu_{2}\left(n-1\choose 4k-1\right)$. For $k=1$ we have

[TABLE]

which is equal to [math] if and only if $4\mid n$. For $k=2$ we have

[TABLE]

which is equal to [math] if and only if $8\mid n$. If $\nu_{2}(n)<2$ then $\nu_{2}\left(n-1\choose 4k-1\right)\geq 1$ for $k\in\{1,2\}$ and, as a consequence, $\nu_{2}\left({n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)\geq 0$ for any $k\leq\left\lfloor\frac{n}{4}\right\rfloor$. If $\nu_{2}(n)=2$ then $\nu_{2}\left({n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)\geq 0$ for $k>1$ and $\nu_{2}\left({n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)=-1$ for $k=1$. Thus $\nu_{2}\left(\sum_{k=1}^{\left\lfloor\frac{n}{4}\right\rfloor}{n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)=-1$. If $\nu_{2}(n)>2$ then $\nu_{2}\left({n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)\geq 0$ for $k>2$ and $\nu_{2}\left({n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)=-1$ for $k\leq 2$. Thus $\nu_{2}\left(\sum_{k=1}^{\left\lfloor\frac{n}{4}\right\rfloor}{n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)\geq 0$. Summing up, if $\nu_{2}(n)\neq 2$ then $\left(\sum_{k=1}^{\left\lfloor\frac{n}{4}\right\rfloor}{n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)$ is an integer and then $n\mid H_{4}(n)-1$. If $\nu_{2}(n)=2$ then $2\left(\sum_{k=1}^{\left\lfloor\frac{n}{4}\right\rfloor}{n-1\choose 4k-1}\cdot\frac{(4k-1)!}{k!4^{k}}\right)$ is an integer and then $\frac{n}{2}\mid H_{4}(n)-1$ while $n\nmid H_{4}(n)-1$. The proof for the case of $d=4$ is finished.

Let us consider the case of prime $d$. If $n<d$ then $H_{d}(n)-1=0$ and obviously $n\mid H_{d}(n)-1$. If $n\geq d$ then $d\mid H_{d}(n)$ and thus $d\nmid H_{d}(n)-1$. Let us write

[TABLE]

Since $d\nmid\frac{n}{d^{\nu_{d}(n)}}$, we thus have $\nu_{d}\left(d^{\nu_{d}(n)}\sum_{k=1}^{\left\lfloor\frac{n}{d}\right\rfloor}{n-1\choose dk-1}\cdot\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}\right)=\nu_{d}(H_{d}(n)-1)=0.$ If $p$ is a prime number not equal to $d$ then

[TABLE]

and $\nu_{p}\left(d^{\nu_{d}(n)}\sum_{k=1}^{\left\lfloor\frac{n}{d}\right\rfloor}{n-1\choose dk-1}\cdot\frac{(dk-1)_{((d-1)k-1)}}{d^{k}}\right)\geq 0$. Finally,

[TABLE]

which means that $\frac{n}{d^{\nu_{d}(n)}}\mid H_{d}(n)-1$ and $\frac{n}{d^{\nu_{d}(n)}}=\text{GCD}(H_{d}(n)-1,n)$. ∎

7.3. Nontrivial common divisors of numbers $H_{a}(n)$ and $H_{b}(n)$

Let us fix two distinct integers $a,b\geq 2$. It is natural to ask about existence of indices $n$ for which the numbers $H_{a}(n)$ and $H_{b}(n)$ have a common divisor greater than $1$. The above question can be answered immediately. Let $d\in\mathbb{N}_{\geq 2}$, $n\in\mathbb{N}_{\geq d}$ and $p$ be a prime divisor of $H_{d}(n)$. Then $p\mid\text{GCD}(H_{d}(n+p),H_{p}(n+p))$. Indeed, it is a simple consequence of periodicity of the sequence $(H_{d}(n)\pmod{p})_{n\in\mathbb{N}}$ and divisibility properties of the sequence $(H_{p}(n))_{n\in\mathbb{N}}$ for prime number $p$. Moreover, we give the following.

Theorem 7.5**.**

Let $d\in\mathbb{N}_{\geq 3}$. Then $2d+1\mid H_{d}(3d+2)$ if and only if $2d+1\mid d!-1$.

If additionally $d$ is odd then

• •

$2d+1\mid H_{2d+1}(3d+2)$* if and only if $2d+1\mid(d!)^{2}-1$.*

• •

$2d+1\mid H_{d}(4d)$* if and only if $2d+1\mid d!+1$;*

• •

$2d+1\mid H_{2d+1}(4d)$* if and only if $2d+1\mid(d!)^{2}-1$.*

Proof.

Since the proofs of the remaining equivalences are very similar, we only show the second equivalence.

By the exact formula for $H_{2d+1}(3d+2)$ we have $H_{2d+1}(3d+2)=1+\frac{(3d+2)_{(2d+1)}}{2d+1}$. We compute

[TABLE]

and we see that the divisibility of $H_{2d+1}(3d+2)$ by $2d+1$ is equivalent to the divisibility of $(d!)^{2}-1$ by $2d+1$.

∎

In the above theorem we needed assumption that $d$ is odd. The next proposition shows that primality of $2d+1$ is necessary and sufiicient for validity of the condition $2d+1\mid(d!)^{2}-1$.

Proposition 7.6**.**

Let $d$ be an odd positive integer. Then $2d+1\mid(d!)^{2}-1$ if and only if $2d+1$ is a prime number.

Proof.

If $2d+1$ is prime then $2d+1\mid H_{2d+1}(3d+2)$ as $3d+2\geq 2d+1$. Thus, by Theorem 7.5 there holds $2d+1\mid(d!)^{2}-1$.

If $2d+1$ is a composite number then by Corollary 3.8 we have $H_{2d+1}(3d+2)\equiv H_{2d+1}(d+1)=1\pmod{2d+1}$ as $d+1<2d+1$. Hence by Theorem 7.5 the condition $2d+1\mid(d!)^{2}-1$ is not satisfied. ∎

Now we are ready to give a formula for the one-parametr infinite family of quadruples $(a,b,n,c)$ such that $c>1$ divides both $H_{a}(n)$ and $H_{b}(n)$.

Corollary 7.7**.**

If $n\geq 3$ is an odd integer such that $2n+1$ is a prime number then $2n+1$ is a common divisor of numbers $H_{n}(3n+2)$ and $H_{2n+1}(3n+2)$ or $H_{n}(4n)$ and $H_{2n+1}(4n)$. More precisely,

• •

$2n+1\mid\text{GCD}(H_{n}(3n+2),H_{2n+1}(3n+2))$* if and only if $2n+1\mid n!-1$;*

• •

$2n+1\mid\text{GCD}(H_{n}(4n),H_{2n+1}(4n))$* if and only if $2n+1\mid n!+1$.*

In other words, if $(a,b,n,c)=(d,2d+1,[2d+1\mid d!-1]\cdot(3d+2)+[2d+1\mid d!+1]\cdot(4d),2d+1)$, where $d$ is an odd positive integer such that $2d+1$ is a prime number and we use the Iverson bracket

[TABLE]

then $c\mid\text{GCD}(H_{a}(n),H_{b}(n))$.

Let us observe that all the examples of quadruples $(a,b,n,c)$ with the property that $c>1$ divides both $H_{a}(n)$ and $H_{b}(n)$ are such that $c=b$ is a prime number and $n\geq b$. This is a motivation to formulate the following.

Question 7.8**.**

Are there infinitely many triples $(a,b,c)\in\mathbb{N}^{3}$, $a,b,c\geq 2$, such that $c>1$ is coprime to $ab$ and $c\mid\text{GCD}(H_{a}(n),H_{b}(n))$ for some $n\in\mathbb{N}$?

Moreover, it is quite natural to ask the following.

Question 7.9**.**

Are there infinitely many pairs $(a,b)\in\mathbb{N}^{2}$, $a,b\geq 2$, such that $\text{GCD}(H_{a}(n),H_{b}(n))=1$ for each $n\in\mathbb{N}$?

8. Some polynomials related to numbers $H_{d}(n)$ and their combinatorial interpretation

Let us define polynomials $H_{d}(n,x)\in\mathbb{Z}[x]$ recursively: $H_{d}(n,x)=x^{n}$ for $n\in\{0,...,d-1\}$ and

[TABLE]

Then $H_{d}(n,1)=H_{d}(n)$ and we have exact formula

[TABLE]

Proposition 8.1**.**

The exponential generating function of the sequence $(H_{d}(n,x))_{n\in\mathbb{N}}$ takes the form

[TABLE]

Proof.

Let us write $e^{xt+\frac{t^{d}}{d}}=\sum_{n=0}^{+\infty}\frac{a_{d}(n,x)}{n!}t^{n}$ By comparing the coefficients near $t^{n-1}$ in the identity

[TABLE]

and multiplying by $(n-1)!$ we get the recurrence

[TABLE]

The above recurrence combined with the fact that

[TABLE]

for $n\in\{0,...,d-1\}$ implies $a_{d}(n,x)=H_{d}(n,x)$ for each $n\in\mathbb{N}$. ∎

Theorem 8.2**.**

Let $\text{Fix}_{n}(\sigma)$ and $S_{d,n}$ denote the set of fixed points of the permutation $\sigma\in S_{n}$ and the set of permutations being product of pairwise disjoint $d$-cycles, respectively. Then, we have the following equality

[TABLE]

Proof.

Let us write the right hand side of the above equality as $g_{d,n}(x)$. We will show that the sequence $(g_{d,n}(x))_{n\in\mathbb{N}}$ satisfies the same recurrence as the sequence $(H_{d}(n,x))_{n\in\mathbb{N}}$. This fact combined with obvious equality $g_{d,n}(x)=x^{n}$ for $n\in\{0,...,d-1\}$ will give us the statement of our theorem.

Let us fix $\sigma\in S_{d,n}$. If $\sigma(n)=n$ then $\sigma=\sigma_{1}$ for some $\sigma_{1}\in S_{d,n-1}$. The number of fixed points of $\sigma$ is equal to the number of fixed points of $\sigma_{1}$ increased by $1$, since $n$ is an extra fixed point of $\sigma$. Hence the summand $x^{\#\text{Fix}_{n}(\sigma)}$ in $g_{d,n}(x)$ reduces with the summand $x^{\#\text{Fix}_{n}(\sigma_{1})+1}$ in $xg_{d,n-1}(x)$. If $\sigma(n)\neq n$ then $\sigma=\sigma_{1}\circ\pi$, where $\pi$ is a $d$-cycle containing $n$ and $\sigma_{1}$ is a product of pairwise disjoint $d$-cycles on a set $\{1,...,n\}\backslash\mbox{supp}(\pi)$. Then $\sigma_{1}$ can be treated as a member of the set $S_{d,n-d}$ and $\#\text{Fix}_{n-d}(\sigma_{1})=\#\text{Fix}_{n}(\sigma)$. Moreover, $\pi$ can be chosen in $(n-1)_{(d-1)}$ ways. Thus the summand $x^{\#\text{Fix}_{n}(\sigma)}$ in $g_{d,n}(x)$ reduces with the summand $x^{\#\text{Fix}_{n}(\sigma_{1})}$ in $(n-1)_{(d-1)}g_{d,n-d}(x)$. Summing over all $\sigma\in S_{d,n}$ we obtain $g_{d,n}(x)=xg_{d,n-1}(x)+(n-1)_{(d-1)}g_{d,n-d}(x)$, which completes the proof. ∎

For given $d\in\mathbb{N}_{\geq 2}$, the sequence of polynomials $(H_{d}(n,x))_{n\in\mathbb{N}}$ contains more precise information concerning the number of permutations in $S_{n}$ which are product of disjoint $d$-cycles. However, because our primary object of study is the sequence $(H_{d}(n))_{n\in\mathbb{N}}$, we offer only few results concerning this natural polynomial generalization. First we prove the following:

Theorem 8.3**.**

Let $d\in\mathbb{N}_{\geq 2}$. Then the following congruence holds for any $n\in\mathbb{N}$:

• •

$H_{d}(n,x)\equiv x^{n}\pmod{d}$* if $d$ is a composite number greater than $4$;*

• •

$H_{d}(n,x)\equiv x^{n}+2\left\lfloor\frac{n}{4}\right\rfloor x^{n-4}=x^{n-4\cdot\left(\left\lfloor\frac{n}{4}\right\rfloor\pmod{2}\right)}(x^{4}+2)^{\left\lfloor\frac{n}{4}\right\rfloor\pmod{2}}\pmod{d}$* if $d=4$;*

• •

$H_{d}(n,x)\equiv x^{n\pmod{d}}(x-1)^{d\left\lfloor\frac{n}{d}\right\rfloor}\pmod{d}$* if $d$ is a prime number.*

Proof.

We will proceed by induction on $n\in\mathbb{N}$. The statement of the theorem is true for $n\in\{0,...,d-1\}$. Let us suppose that $d>4$ is a composite number and $n\geq d$. Then the product of consecutive $d-1$ integers is divisible by $d$, thus by the recurrence formula and inductive hypothesis for $n-1$ we have

[TABLE]

Suppose now that $d=4$ and $n\geq 4$. If $4\mid n$ then, by the recurrence defining polynomials $H_{4}(n,x)$, inductive hypothesis for $n-1$ and $n-4$ and the fact that $(n-1)_{(3)}\equiv 3!\equiv 2\pmod{4}$, we obtain the following:

[TABLE]

If $4\nmid n$ then, by the recurrence defining polynomials $H_{4}(n,x)$, inductive hypothesis for $n-1$ and the fact that among the numbers $n-3$, $n-2$, $n-1$ there is a one divisible by $4$, we obtain the following:

[TABLE]

Since the polynomial $x^{4}+2$ is irreducible over the ring $\mathbb{Z}/4\mathbb{Z}$, thus $H_{4}(n,x)\equiv x^{n}+2\left\lfloor\frac{n}{4}\right\rfloor x^{n-4}=x^{n-4\cdot\left(\left\lfloor\frac{n}{4}\right\rfloor\pmod{2}\right)}(x^{4}+2)^{\left\lfloor\frac{n}{4}\right\rfloor\pmod{2}}\pmod{4}$ is a factorization of the polynomial $H_{4}(n,x)$ modulo $4$.

Assume now that $d$ is a prime number and $n\geq d$ and the statement is true for any non-negative integer less than $n$. If $d\mid n$ then

[TABLE]

If $d\nmid n$ then, by the recurrence defining polynomials $H_{d}(n,x)$, inductive hypothesis for $n-1$ and the fact that among the numbers $(n-d+1)$, …, $(n-1)$ there is a one divisible by $d$, we obtain the following:

[TABLE]

∎

Now, we concentrate on the case $d=2$ and prove the following

Theorem 8.4**.**

Let $U(n,x)=H_{2}(n-1,x)H_{2}(n+1,x)-H_{2}(n,x)^{2}$ for $n\in\mathbb{N}_{+}$.

1. (1)

We have $U(n,x)=V(n,x^{2})$, where $V(n,x)\in\mathbb{Z}[x]$ is of degree $n-1$. 2. (2)

We have $V(1,x)=1,V(2,x)=x-1,V(3,x)=x^{2}+3$ and for $n\geq 4$ the following recurrence relation is true:

[TABLE] 3. (3)

We have the following identity

[TABLE] 4. (4)

Let us write $V(n,x)=\sum_{i=0}^{n-1}a(i,n)x^{i}$. Then

[TABLE]

and

[TABLE]

Proof.

From the expression for $H_{2}(n,x)$ we see that it is an odd polynomial if $n\equiv 1\pmod{2}$ and an even polynomial in case of $n\equiv 0\pmod{2}$. We thus get that the polynomial $U(n,x)=H_{2}(n-1,x)H_{2}(n+1,x)-H_{2}(n,x)^{2}$ is an even polynomial and for each $n\in\mathbb{N}_{+}$ we can write $U(n,x)=V(n,x^{2})$ for some polynomial $V(n,x)$. The expressions for $V(n,x)$ for $n\in\{1,2,3\}$ are clear from the shape of $H_{2}(n,x)$ for $n\in\{1,2,3,4\}$.

Let us observe that the sequence $(H_{2}(n,x))_{n\in\mathbb{N}}$ is a holonomic sequence of polynomials. Indeed, this is consequence of the fact that the generating function $\mathcal{H}_{d}(x,t)$ (as a function in variable $t$) is $D$-finite for each $d$, i. e. is a solution of some linear differential equation with polynomial coefficients. We recall that a sequence is holonomic if satisfies the recurrence relation with coefficients being polynomials in $n$. It is well known that if $(f_{n})_{n\in\mathbb{N}},(g_{n})_{n\in\mathbb{N}}$ are holonomic sequences then the sequences $(f_{n}\pm g_{n})_{n\in\mathbb{N}},(f_{n}g_{n})_{n\in\mathbb{N}}$ are holonomic too. It is straightforward (but a bit tedious) exercise to check that the sequence $(U(n,x))_{n\in\mathbb{N}_{+}}$ satisfies the relation given in the statement of our theorem (with $x$ replaced by $x^{2}$) and hence the sequence $(V(n,x))_{n\in\mathbb{N}_{+}}$ satisfies exactly the relation presented above.

If we define $\mathcal{V}(x,t)=\sum_{n=0}^{\infty}\frac{V(n+1,x)}{n!}t^{n}$, then it is an easy task to produce the differential equation satisfied by the function $\mathcal{V}(x,t)$. Indeed, applying standard methods and the relation (15) we check that

[TABLE]

The initial condition $\mathcal{V}(x,0)=1$ allow us to compute the unique solution of the above differential equation in the form

[TABLE]

which is exactly the expression presented in the statement of our theorem. Now, it is an easy task to compute the coefficient $a(i,n)$ for $i=0,1$. We have $a(0,1)=1,a(0,2)=-1,a(1,2)=1,a(0,3)=3,a(1,3)=0$ and our formulas are true in case of $n=1,2,3$. We see that the sequence $(a(0,n))_{n\in\mathbb{N}}$ satisfies the recurrence relation of degree 3 given by

[TABLE]

The above relation comes from the relation (15) by taking $x=0$. However, a closer look reveals that our sequence satisfies simpler recurrence relation

[TABLE]

and a direct check shows that the expressions for $a(0,2n),a(0,2n+1)$ presented in the statement satisfy the above recurrence relation. Similarly, by differentiating the recurrence relation (15) with respect to $x$ and taking the limit $x\rightarrow 0$ we get that the sequence $(a(1,n))_{n\in\mathbb{N}_{\geq 2}}$ satisfies the recurrence relation

[TABLE]

A direct check confirms that the expressions for $a(1,2n),a(1,2n+1)$ given in the statement are correct. We omit simple details.

Having proved the expressions for $a(0,n),a(1,n)$ we are ready to prove positivity of $a(i,n)$ for $i\in\{2,\ldots,n-1\}$. First, we get rid of the [math]-th coefficient in $V(n+1,x)$ by differentiating this polynomial with respect to $x$. Thus, by differentiating the generating function $\mathcal{V}(x,t)$ with respect to $x$, we arrive to the identity

[TABLE]

Dividing the last equality by $t$, comparing expansions on both sides of the above identity, we see that the polynomial $V^{\prime}(n+2,x)/(n+1)$ is just the binomial convolution of the integer sequence $(h_{n})_{n\in\mathbb{N}}$ and the sequence of polynomials $(R_{n}(x))_{n\in\mathbb{N}}$, where

[TABLE]

More precisely,

[TABLE]

The power series expansion of $F_{1}(t)$ is well known and we get that

[TABLE]

In consequence, we see that the coefficients of the power series expansion of $F_{1}(t^{2})$ are non-negative. Next, from the definition of $F_{2}(t)$ we see that $R_{0}(x)=1$. Moreover, we have that

[TABLE]

The above equality, together with the power series expansion $1/(1-t)^{2}=\sum_{n=0}^{\infty}(n+1)t^{n}$ allow us to get the recurrence relation satisfied by the sequence $(R_{n}(x))_{n\in\mathbb{N}}$. Indeed, by comparing the coefficients near $t^{n}$ we easily get

[TABLE]

Let us observe that $R_{n}(0)=0$ for $n\geq 1$ and $x=0$ is a simple root. Indeed, the simplicity of the root $x=0$ is clear from the relation

[TABLE]

Thus, $R_{n}^{\prime}(0)=1$ for $n\geq 1$. Moreover, from the recurrence relation satisfied by the sequence $(R_{n}(x))_{n\in\mathbb{N}}$, it is clear that $\operatorname{deg}R_{n}=n$ and by writing $R_{n}(x)=\sum_{i=0}^{n}b(i,n)x^{i}$ we get $b(i,n)>0$ for $i\in\{1,\ldots,n\}$. Finally, by comparing the coefficients near $x^{i},i\in\{1,\ldots,n-1\}$, on both sides of the formula (17) we get the identity

[TABLE]

In consequence $a(i,n)>0$ for each $i\in\{1,...,n-1\}$. ∎

Remark 8.5**.**

Let us note that the sequence of polynomials $(R_{n}(x))_{n\in\mathbb{N}}$ coming from the power series expansion

[TABLE]

is also an interesting object. Indeed, if we write $R_{n}(x)=\sum_{i=0}^{n}b(i,n)x^{i}$, then the double array of coefficients $(b(i,n))$, where $n\in\mathbb{N}$ and $i\in\{0,\ldots,n\}$, can be easily found in OEIS database as the sequence A271703 [11]. The sequence is called the unsigned Lah numbers and has closed form $b(i,n)=\binom{n-1}{i-1}n!/i!$ for $n\in\mathbb{N}_{+}$ and $i\in\{1,\ldots,n-1\}$. It has many combinatorial interpretations. More precisely, the number $b(i,n)$ counts: (1) partially ordered sets on $n$ elements that consist entirely of $k$ chains; (2) number of ways to split the set $\{1,\ldots,n\}$ into an ordered collection of $n+1-i$ non-crossing nonempty sets; and (3) Dyck $n$-paths with $n+1-i$ peaks labeled $1,2,\ldots,n+1-i$ in some order, see [8]. It would be nice to have combinatorial explanation of the identity (18). **

Remark 8.6**.**

The positivity of coefficients of the polynomial $V(n,x)$ is a bit unexpected property and the question arises whether similar phenomena hold for the case of $d\neq 2$. It seems that the direct generalization does not work. However, based on some numerical experiments we are able to formulate the following general

Conjecture 8.7**.**

Let $d\in\mathbb{N}_{\geq 2}$ and define $U_{d}(n,x)=H_{d}(n-d,x)H_{d}(n+d,x)-H_{d}(n)^{2}$. Then, for $n\geq d$ there is a polynomial $V_{d}(n,x)\in\mathbb{Z}[x]$ of degree $\operatorname{deg}V_{d}(n,x)=2\left\lfloor\frac{n}{d}\right\rfloor-1$ such that

[TABLE]

and all coefficients of $V_{d}(n,x)$ are positive. In particular, for each $d\in\mathbb{N}_{\geq 2}$ and $n\geq d$ we have

[TABLE]

It is possible to prove the above conjecture in the case $d=2$ by using the same approach as in the proof of Theorem 8.4. More precisely, one can prove the identity

[TABLE]

and careful analysis of the convolution form of the polynomial $U_{2}(n,\sqrt{x})$ allows to prove that if $n\equiv 1\pmod{2}$, then all coefficients but [math]th are positive; in case of $n\equiv 0\pmod{2}$ all coefficients are positive. However, it seems that this approach can not be used in order to get the positivity of the coefficients of the polynomial $V_{d}(n,x)$ (or equivalently, the non-negativity of coefficients of the polynomial $U_{d}(n,x)$).

It is clear that our discussion is connected with the concept of concavity of sequences. More precisely, let us recall that the sequence ${\bf a}=(a_{n})_{n\in\mathbb{N}}$ is called logarithmically concave sequence, or a log-concave sequence for short, if $a_{n}^{2}\geq a_{n-1}a_{n+1}$ holds for all $n\geq k$ for some $k$. If the opposite inequality is satisfied for $n\geq k$, then the sequence is called logarithmically convex (log-convex for short). Let us observe that if the sequence ${\bf a}$ is positive, then the log-concavity of ${\bf a}$ implies the log-convexity of the sequence ${\bf a}^{-1}=(a_{n}^{-1})_{n\in\mathbb{N}}$ (and vice-versa of course). As an immediate consequence of Theorem 8.4, we get the following

Proposition 8.8**.**

If $x\geq 1$, then the sequence $(H_{2}(n,x))_{n\in\mathbb{N}}$ is log-convex. In particular, we have

[TABLE]

and the sequence $(H_{2}(n))_{n\in\mathbb{N}}$ is log-convex.

Let us note that from the work of Bender and Canfield [2] we know that for each $d\in\mathbb{N}_{\geq 2}$ and any given $x>0$, there is an integer $N_{d}(x)$ such that the sequence $(H_{d}(n,x))_{n\geq N_{d}(x)}$ is log-convex. However, the question concerning the non-negativity of coefficients of the polynomial $U_{d}(n,x)$ is of different nature. In fact, it is not even clear whether for given positive $x$, the inequality $U_{d}(n,x)\geq 0$ is true.**

One can also note that the non-zero coefficients of the polynomial $U_{2}(n,x)$ are not too small. Indeed, this is a consequence of the following

Proposition 8.9**.**

Let $d\in\mathbb{N}_{\geq 2}$ be fixed. Then, for $n\geq d$, the following congruence is true

[TABLE]

Proof.

The proof of the above congruence can be performed with the help of the basic recurrence relation satisfied by the sequence $(H_{d}(n,x))_{n\in\mathbb{N}}$ and the induction. We left the details for the reader. ∎

In fact, the following stronger result is true.

Theorem 8.10**.**

Let $d\in\mathbb{N}_{\geq 2}$. Then

[TABLE]

Proof.

If $d$ is a prime number then by Theorem 8.3 we have

[TABLE]

which combined with the congruence $H_{d}(n-d,x)H_{d}(n+d,x)\equiv H_{d}(n,x)^{2}\pmod{(d-1)!}$ and the fact that $d$ and $(d-1)!$ are coprime, gives the congruence $H_{d}(n-d,x)H_{d}(n+d,x)\equiv H_{d}(n,x)^{2}\pmod{d!}$ for each integer $n\geq d$.

If $d$ is a composite number then at first we show the equivalence of the condition

[TABLE]

with the condition

[TABLE]

For $n=d$ we have the following chain of equivalences:

[TABLE]

Since $(2d-1)_{(d-1)}\equiv(d-1)!\pmod{d}$ for any positive integer $d$, thus the last congruence is equivalent to $2{2d-1\choose d-1}\equiv 2\pmod{d}$. Now, let us assume that $n\geq d>4$ and $H_{d}(n-d,x)H_{d}(n+d,x)\equiv H_{d}(n,x)^{2}\pmod{d!}$. Then we have the following chain of equivalences:

[TABLE]

where we used Theorem 8.3 and the fact that a composite number $d\geq 6$ divides a product of any consecutive $d-1$ integers.

Assume that $d=p^{2}$ for some odd prime number $p$. Then

[TABLE]

In order to prove the congruence ${n-p^{2}\choose p^{2}-1}+{n+p^{2}\choose p^{2}-1}\equiv 2{n\choose p^{2}-1}\pmod{p^{2}}$ for $n\geq p^{2}$ we will compute ${n\choose p^{2}-1}$ modulo $p^{2}$. If $p^{2}\mid n+1$ then, similarly as above, we prove that ${n\choose p^{2}-1}\equiv 1\pmod{p^{2}}$. If $\nu_{p}(n+1)=1$ then we write $n+1=kp^{2}+lp$ for some $k,l\in\mathbb{N}_{+}$ with $l<p$ and compute

[TABLE]

If $p\nmid n+1$ then we write $n+1=kp^{2}+lp+m$ for some $k,m\in\mathbb{N}_{+}$ and $l\in\mathbb{N}$ with $l,m<p$ and compute

[TABLE]

Thus, independently on the $p$-adic valuation of $n+1$, there holds ${n-p^{2}\choose p^{2}-1}+{n+p^{2}\choose p^{2}-1}\equiv 2{n\choose p^{2}-1}\pmod{p^{2}}$. The only non-trivial case is $\nu_{p}(n+1)=1$. Then, writing $n+1=kp^{2}+lp$ for some $k,l\in\mathbb{N}_{+}$ with $l<p$, we obtain the following:

[TABLE]

We have just proven the validity of congruences (19) for $d$ being a square of an odd prime number.

In the sequel, we assume that $d$ is a composite number not being a square of any prime number and satisfying congruences $H_{d}(n-d,x)H_{d}(n+d,x)\equiv H_{d}(n,x)^{2}\pmod{d!}$, $n\geq d$. Let us note that if congruences ${n-d\choose d-1}+{n+d\choose d-1}\equiv 2{n\choose d-1}\pmod{d}$ hold for each integer $n\geq d$ then, by the identity ${n+1\choose c+1}-{n\choose c+1}={n\choose c}$, the congruences ${n-d\choose c}+{n+d\choose c}\equiv 2{n\choose c}\pmod{d}$ are satisfied for each integers $n\geq d$ and $c\in\{0,...,d-1\}$. We have the following chain of congruences:

[TABLE]

[TABLE]

Assume now that $d$ is a composite number not of the form $2p$, $2p^{2}$ for some odd prime number $p$ or $2^{k}$ for some integer $k\geq 2$. Then there is an odd prime number $p$ such that $d=tp^{s}$, where $s\in\mathbb{N}_{+}$ and $t\geq 3$ is an integer with $p$-adic valuation less than $s$. Taking $c=2p^{s}$ and $n=p^{d}-1$ in the expression $\frac{2}{c!}\sum_{k=1}^{\left\lfloor\frac{c}{2}\right\rfloor}d^{2k}\sum_{0\leq j_{1}<...<j_{c-2k}\leq c-1}(n-j_{1})\cdot...\cdot(n-j_{c-2k})$, we obtain

[TABLE]

Since $d>s$, we have $\nu_{p}(p^{d}-1-i)=\nu_{p}(1+i)$ for any $i\in\{0,...,2p^{s}-1\}$. Hence, the summand with the least $p$-adic valuation is

[TABLE]

obtained for $k=1$, $j_{i}=i-1$, $i\in\{1,...,p^{s}\}$, and $j_{i}=i$, $i\in\{p^{s}+1,...,2p^{s}-2\}$. By the equality $\nu_{p}(p^{d}-1-i)=\nu_{p}(1+i)$ for any $i\in\{0,...,2p^{s}-1\}$ this summand has $p$-adic valuation equal to $2\nu_{p}(t)<s+\nu_{p}(t)=\nu_{p}(d)$. Any other summand has strictly greater $p$-adic valuation because some from the factors $p^{d}-1,...,p^{d}-p^{s}+1,p^{d}-p^{s}-1,...,p^{d}-2p^{s}+1$, having $p$-adic valuations less than $s$, are replaced by $p^{d}-p^{s}$, $p^{d}-2p^{s}$ or $d=tp^{s}$ with $p$-adic valuations at least equal to $s$. Thus, the whole sum $\frac{1}{(2p^{s}-1)_{(p^{s}-1)}(p^{s}-1)!}\sum_{k=1}^{p^{s}}t^{2k}p^{2s(k-1)}\sum_{0\leq j_{1}<...<j_{c-2k}\leq c-1}(p^{d}-1-j_{1})\cdot...\cdot(p^{d}-1-j_{c-2k})$ has $p$-adic valuation less than $\nu_{p}(d)$, which implies that it cannot be divisible by $d$ - a contradiction.

We are checking now the numbers $d$ of the form $2p$, $2p^{2}$ for some odd prime number $p$. We compute the value ${2d-1\choose d-1}\pmod{p}$. For shortening the proof we will perform the computation for numbers $d=2p^{2}$ as for the remaining case the computations are simpler.

[TABLE]

Then $2{4p^{2}-1\choose 2p^{2}-1}\equiv 6\pmod{p}$ but, on the other hand, there should be $2{4p^{2}-1\choose 2p^{2}-1}\equiv 2\pmod{p}$. This implies the congruence $6\equiv 2\pmod{p}$ and, as a result, $p\mid 4$ - a contradiction, as $p$ is an odd prime number.

Let $d=2^{k}$ for an integer $k\geq 3$. We compute the value ${2d-1\choose d-1}\pmod{p}$:

[TABLE]

Then $2{2^{k+1}-1\choose 2^{k}-1}\equiv 6\pmod{8}$ but, on the other hand, there should be $2{2^{k+1}-1\choose 2^{k}-1}\equiv 2\pmod{8}$. This implies the congruence $6\equiv 2\pmod{8}$ and, as a result, $8\mid 4$ - a contradiction.

We are left with the case $d=4$. By (20), the condition $H_{4}(0,x)H_{4}(8,x)\equiv H_{4}(4,x)^{2}\pmod{4!}$ is equivalent to the condition $2{7\choose 3}\equiv 2\pmod{4}$, which holds. It is easy to compute that

[TABLE]

Assuming that $H_{4}(n-4,x)H_{4}(n+4,x)\equiv H_{4}(n,x)^{2}\pmod{4!}$, we prove similarly as in (21) that the congruence $H_{4}(n-3,x)H_{4}(n+5,x)\equiv H_{4}(n+1,x)^{2}\pmod{4!}$ is equivalent to

[TABLE]

Further, the above condition is equivalent to the following equivalent congruences:

[TABLE]

The last congruence is true, because $2\left(\left\lfloor\frac{n-7}{4}\right\rfloor+\left\lfloor\frac{n+4}{4}\right\rfloor\right)\equiv 2\left(\left\lfloor\frac{n-4}{4}\right\rfloor+\left\lfloor\frac{n+1}{4}\right\rfloor\right)\equiv 2\left(\left\lfloor\frac{n-3}{4}\right\rfloor+\left\lfloor\frac{n}{4}\right\rfloor\right)\pmod{4}$, $\left(\left\lfloor\frac{n-7}{4}\right\rfloor+\left\lfloor\frac{n+1}{4}\right\rfloor\right)\equiv 0\pmod{2}$ and by (22) we have ${n-4\choose 3}+{n+4\choose 3}\equiv 2{n\choose 3}\pmod{4}$ and ${n-4\choose 3}(n+4)_{(3)}\equiv{n\choose 3}(n)_{(3)}\pmod{4}$. Hence, $H_{4}(n-4,x)H_{4}(n+4,x)\equiv H_{4}(n,x)^{2}\pmod{4!}$ for each integer $n\geq 4$. ∎

Two further identities involving elements of the sequence $(H_{d}(n,x))_{n\in\mathbb{N}}$ can be proved. More precisely, we have the following:

Theorem 8.11**.**

Let $d\in\mathbb{N}_{\geq 2}$ be given. For each $n\in\mathbb{N}$ the following identities hold

[TABLE]

9. Some related observations, questions and conjectures

In this section we collect observations concerning some related sequences connected with the family of sequences $(H_{d}(n))_{n\in\mathbb{N}}$ and formulate several questions and conjectures appeared during our investigations.

In [1] the authors introduced the summatory sequence for the sequence of involutions $(H_{2}(n))_{n\in\mathbb{N}}$. Thus, it is natural to consider the sequence $(G_{d}(n))_{n\in\mathbb{N}}$ for $d\in\mathbb{N}_{\geq 2}$ with

[TABLE]

From the definition, the number $G_{d}(n)$ can be seen as a number of all permutations in $\coprod_{i=1}^{n}S_{i}$ which are products of cycles of length $d$.

Let us recall the following useful result.

Lemma 9.1** (Lemma 5.2 in [1]).**

If $A(x)=\sum_{n=0}^{\infty}\frac{a_{n}}{n!}x^{n}$ and $s_{n}=\sum_{i=0}^{n}a_{i}$ then

[TABLE]

We are ready to prove the following

Theorem 9.2**.**

1. (1)

We have

[TABLE] 2. (2)

The sequence $(G_{d}(n))_{n\in\mathbb{N}}$ satisfies the following recurrence relation: $G_{d}(i)=i+1$ for $i=-1,\ldots,d-1$, and for $n\geq d$ we have

[TABLE]

Proof.

In order to get the exponential generating function for the sequence $(G_{d}(n))_{n\in\mathbb{N}}$ we apply Lemma 9.1 with $A(x)=\mathcal{H}_{d}(x)$ and get the result.

The recurrence relation for the sequence $(G_{d}(n))_{n\in\mathbb{N}}$ can be easily proved by noting the identity $H_{d}(n)=G_{d}(n)-G_{d}(n-1)$. Indeed, from the relation (1) we get

[TABLE]

and hence the result. ∎

We can apply the previous result and get the following general fact (with special case for $d=2$ obtained by Amdeberhan and Moll).

Corollary 9.3**.**

We have the following identity:

[TABLE]

Proof.

We have $\mathcal{H}_{d}(x)=e^{x+\frac{x^{d}}{d}}$ and using the first part of Theorem 9.2 we get

[TABLE]

Comparing the coefficients on both sides of the first and the last expression we get the result. ∎

In the paper [1] the authors were able to compute exact expression for the 2-adic valuation of $G_{2}(n)$. One can ask whether it is possible to compute $\nu_{p}(G_{p}(n))$ for $p\in\mathbb{P}$ and $n\in\mathbb{N}_{+}$. A numerical computations suggest the following:

Conjecture 9.4**.**

1. (1)

We have the following expression

[TABLE] 2. (2)

We have the following expression

[TABLE]

It is very likely that the method employed by Amdeberhan and Moll can be extended in order to confirm the above conjecture. However, it would be nice to have general method which works for all $p\in\mathbb{P}$.

Let $d\in\mathbb{N}_{\geq 2}$ be fixed and for $n\in\mathbb{N}_{+}$ define the matrix

[TABLE]

Based on numerical calculations we formulate the following

Conjecture 9.5**.**

Let $d\in\mathbb{N}_{\geq 2}$.

1. (1)

For $n\in\mathbb{N}_{+}$ we have $\operatorname{det}M_{d}(n,x)\in\mathbb{Z}$ and

[TABLE] 2. (2)

For $n\in\mathbb{N}_{+}$ we have the identity

[TABLE] 3. (3)

If $d\geq 3$, then we have the following property

[TABLE]

Let $a,b\in\mathbb{N}_{\geq 2}$ with $a<b$. It seems to be interesting to find out if there are some integers $n\geq a$ and $m\geq b$ such that

[TABLE]

We only know that if $a$ is a prime number then the equation (24) has no solutions, as $a$ divides the left hand side and does not divide the right hand side.

Question 9.6**.**

Is there any quadruple $(a,b,n,m)\in\mathbb{N}^{4}$ such that $2\leq a<b$, $n\geq a$, $m\geq b$ and $H_{a}(n)=H_{b}(m)$? If yes, are there infinitely many such quadruples?