Related papers: The Generating Function for the Dirichlet Series $…
We introduce a novel arithmetic function $w(n)$, a generalization of the Liouville function $\lambda(n)$, as the coefficients of a Dirichlet series. By spatially encoding information in a natural way about the distribution of prime factors…
The Dirichlet lambda function $\lambda(s)$ is defined for $\mathrm{Re}(s) > 1$ by \[ \lambda(s) = \sum_{n=0}^{\infty} \frac{1}{(2n+1)^s}. \] This function was initially studied by Euler on the real line, where he denoted it by $N(s)$. In…
Similar to the associated Legendre functions, the differential equation for the associated Bessel functions $B_{l,m}(x)$ is introduced so that its form remains invariant under the transformation $l\rightarrow -l-1$. A Rodrigues formula for…
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…
We establish an integral representation for the Dirichlet generating function of the coefficients of Euler's pentagonal number theorem. The Bromwich-type integral enables analytic continuation to the entire complex plane, filling a gap in…
$L$ functions based on Dirichlet characters are natural generalizations of the Riemann $\zeta(s)$ function: they both have series representations and satisfy an Euler product representation, i.e. an infinite product taken over prime…
In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…
The first aim of this paper is to construct new generating functions for the generalized {\lambda}-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers, attached…
The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading…
There exist many explicit evaluations of Dirichlet series. Most of them are constructed via the same approach: by taking products or powers of Dirichlet series with a known Euler product representation. In this paper we derive a result of a…
Let $F_n$ and $L_n$ be the Fibonacci and Lucas numbers, respectively. Four corresponding zeta functions in $s$ are defined by \[\zeta_F(s) \,:=\, \sum_{n=1}^{\infty} \frac{1}{F_n^s}\,,\quad \zeta_F^*(s) \,:=\,\sum_{n=1}^{\infty}…
The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…
We define a new class of generating function transformations related to polylogarithm functions, Dirichlet series, and Euler sums. These transformations are given by an infinite sum over the $j^{th}$ derivatives of a sequence generating…
Generating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than ordinary and exponential…
The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…
We construct new integral representations for transformations of the ordinary generating function for a sequence, $\langle f_n \rangle$, into the form of a generating function that enumerates the corresponding "square series" generating…
In this article we study some properties of the discrete convolution of Liouville function $S(n):=\sum_{m_{1}+m_{2}=n}\lambda\left(m_{1}\right)\lambda\left(m_{2}\right)$, which is a Goldbach-type counting function of representations. In…
A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…
We present a short, direct proof of the fact that the generating function of all permutations of a fixed length $n\geq 4$ is divisible by $(1+z)^m$, where $m=\lfloor (n-2)/2 \rfloor$.
Let $q\ge3$ be an integer, $\chi$ denote a Dirichlet character modulo $q$, for any real number $a\ge 0$, we define the generalized Dirichlet $L$-functions $$ L(s,\chi,a)=\sum_{n=1}^{\infty}\frac{\chi(n)}{(n+a)^s}, $$ where $s=\sigma+it$…