Generating function transformation

In mathematics a transformation of a sequence's generating function provides a method of converting the generating function for one sequence into a generating function enumerating another. These transformations typically involve integral formulas applied to a sequence generating function (see integral transformations) or weighted sums over the higher-order derivatives of these functions (see derivative transformations).

Given a sequence, { f n } n = 0 ∞ {\displaystyle \{f_{n}\}_{n=0}^{\infty }} , the ordinary generating function (OGF) of the sequence, denoted F ( z ) {\displaystyle F(z)} , and the exponential generating function (EGF) of the sequence, denoted F ^ ( z ) {\displaystyle {\widehat {F}}(z)} , are defined by the formal power series:

F ( z ) = ∑ n = 0 ∞ f n z n = f 0 + f 1 z + f 2 z 2 + ⋯ {\displaystyle F(z)=\sum _{n=0}^{\infty }f_{n}z^{n}=f_{0}+f_{1}z+f_{2}z^{2}+\cdots }

F ^ ( z ) = ∑ n = 0 ∞ f n n ! z n = f 0 0 ! + f 1 1 ! z + f 2 2 ! z 2 + ⋯ . {\displaystyle {\widehat {F}}(z)=\sum _{n=0}^{\infty }{\frac {f_{n}}{n!}}z^{n}={\frac {f_{0}}{0!}}+{\frac {f_{1}}{1!}}z+{\frac {f_{2}}{2!}}z^{2}+\cdots .}

In this article, we use the convention that the ordinary (exponential) generating function for a sequence { f n } {\displaystyle \{f_{n}\}} is denoted by the uppercase function F ( z ) {\displaystyle F(z)} / F ^ ( z ) {\displaystyle {\widehat {F}}(z)} for some fixed or formal z {\displaystyle z} when the context of this notation is clear. Additionally, we use the bracket notation for coefficient extraction from the Concrete Mathematics reference which is given by [ z n ] F ( z ) := f n {\displaystyle [z^{n}]F(z):=f_{n}} . The main article gives examples of generating functions for many sequences. Other examples of generating function variants include Dirichlet generating functions (DGFs), Lambert series, and Newton series. In this article we focus on transformations of generating functions in mathematics and keep a running list of useful transformations and transformation formulas.

Series multisection provides formulas for generating functions enumerating the sequence { f a n + b } {\displaystyle \{f_{an+b}\}} given an ordinary generating function F ( z ) {\displaystyle F(z)} where a , b ∈ N {\displaystyle a,b\in \mathbb {N} } , a ≥ 2 {\displaystyle a\geq 2} , and 0 ≤ b < a {\displaystyle 0\leq b<a} . In the first two cases where ( a , b ) := ( 2 , 0 ) , ( 2 , 1 ) {\displaystyle (a,b):=(2,0),(2,1)} , we can expand these arithmetic progression generating functions directly in terms of F ( z ) {\displaystyle F(z)} :

∑ n ≥ 0 f 2 n z 2 n = 1 2 ( F ( z ) + F ( − z ) ) {\displaystyle \sum _{n\geq 0}f_{2n}z^{2n}={\frac {1}{2}}\left(F(z)+F(-z)\right)}

∑ n ≥ 0 f 2 n + 1 z 2 n + 1 = 1 2 ( F ( z ) − F ( − z ) ) . {\displaystyle \sum _{n\geq 0}f_{2n+1}z^{2n+1}={\frac {1}{2}}\left(F(z)-F(-z)\right).}

More generally, suppose that a ≥ 3 {\displaystyle a\geq 3} and that ω a := exp ⁡ ( 2 π ı a ) {\displaystyle \omega _{a}:=\exp \left({\frac {2\pi \imath }{a}}\right)} denotes the a t h {\displaystyle a^{th}} primitive root of unity. Then we have the following formula,^[1] often known as the root of unity filter:

∑ n ≥ 0 f a n + b z a n + b = 1 a × ∑ m = 0 a − 1 ω a − m b F ( ω a m z ) . {\displaystyle \sum _{n\geq 0}f_{an+b}z^{an+b}={\frac {1}{a}}\times \sum _{m=0}^{a-1}\omega _{a}^{-mb}F\left(\omega _{a}^{m}z\right).}

For integers m ≥ 1 {\displaystyle m\geq 1} , another useful formula providing somewhat reversed floored arithmetic progressions are generated by the identity^[2]

∑ n ≥ 0 f ⌊ n m ⌋ z n = 1 − z m 1 − z F ( z m ) = ( 1 + z + ⋯ + z m − 2 + z m − 1 ) F ( z m ) . {\displaystyle \sum _{n\geq 0}f_{\lfloor {\frac {n}{m}}\rfloor }z^{n}={\frac {1-z^{m}}{1-z}}F(z^{m})=\left(1+z+\cdots +z^{m-2}+z^{m-1}\right)F(z^{m}).}

The exponential Bell polynomials, B n , k ( x 1 , … , x n ) := n ! ⋅ [ t n u k ] Φ ( t , u ) {\displaystyle B_{n,k}(x_{1},\ldots ,x_{n}):=n!\cdot [t^{n}u^{k}]\Phi (t,u)} , are defined by the exponential generating function^[3]

Φ ( t , u ) = exp ⁡ ( u × ∑ m ≥ 1 x m t m m ! ) = 1 + ∑ n ≥ 1 { ∑ k = 1 n B n , k ( x 1 , x 2 , … ) u k } t n n ! . {\displaystyle \Phi (t,u)=\exp \left(u\times \sum _{m\geq 1}x_{m}{\frac {t^{m}}{m!}}\right)=1+\sum _{n\geq 1}\left\{\sum _{k=1}^{n}B_{n,k}(x_{1},x_{2},\ldots )u^{k}\right\}{\frac {t^{n}}{n!}}.}

The next formulas for powers, logarithms, and compositions of formal power series are expanded by these polynomials with variables in the coefficients of the original generating functions.^[4][5] The formula for the exponential of a generating function is given implicitly through the Bell polynomials by the EGF for these polynomials defined in the previous formula for some sequence of { x i } {\displaystyle \{x_{i}\}} .

The power series for the reciprocal of a generating function, F ( z ) {\displaystyle F(z)} , is expanded by

1 F ( z ) = 1 f 0 − f 1 f 0 2 z + ( f 1 2 − f 0 f 2 ) f 0 3 z 2 − f 1 3 − 2 f 0 f 1 f 2 + f 0 2 f 3 f 0 4 z 3 + ⋯ . {\displaystyle {\frac {1}{F(z)}}={\frac {1}{f_{0}}}-{\frac {f_{1}}{f_{0}^{2}}}z+{\frac {\left(f_{1}^{2}-f_{0}f_{2}\right)}{f_{0}^{3}}}z^{2}-{\frac {f_{1}^{3}-2f_{0}f_{1}f_{2}+f_{0}^{2}f_{3}}{f_{0}^{4}}}z^{3}+\cdots .}

If we let b n := [ z n ] 1 / F ( z ) {\displaystyle b_{n}:=[z^{n}]1/F(z)} denote the coefficients in the expansion of the reciprocal generating function, then we have the following recurrence relation:

b n = − 1 f 0 ( f 1 b n − 1 + f 2 b n − 2 + ⋯ + f n b 0 ) , n ≥ 1. {\displaystyle b_{n}=-{\frac {1}{f_{0}}}\left(f_{1}b_{n-1}+f_{2}b_{n-2}+\cdots +f_{n}b_{0}\right),n\geq 1.}

Let m ∈ C {\displaystyle m\in \mathbb {C} } be fixed, suppose that f 0 = 1 {\displaystyle f_{0}=1} , and denote b n ( m ) := [ z n ] F ( z ) m {\displaystyle b_{n}^{(m)}:=[z^{n}]F(z)^{m}} . Then we have a series expansion for F ( z ) m {\displaystyle F(z)^{m}} given by

F ( z ) m = 1 + m f 1 z + m ( ( m − 1 ) f 1 2 + 2 f 2 ) z 2 2 + ( m ( m − 1 ) ( m − 2 ) f 1 3 + 6 m ( m − 1 ) f 1 f 2 + 6 m f 3 ) z 3 6 + ⋯ , {\displaystyle F(z)^{m}=1+mf_{1}z+m\left((m-1)f_{1}^{2}+2f_{2}\right){\frac {z^{2}}{2}}+\left(m(m-1)(m-2)f_{1}^{3}+6m(m-1)f_{1}f_{2}+6mf_{3}\right){\frac {z^{3}}{6}}+\cdots ,}

and the coefficients b n ( m ) {\displaystyle b_{n}^{(m)}} satisfy a recurrence relation of the form

n ⋅ b n ( m ) = ( m − n + 1 ) f 1 b n − 1 ( m ) + ( 2 m − n + 2 ) f 2 b n − 2 ( m ) + ⋯ + ( ( n − 1 ) m − 1 ) f n − 1 b 1 ( m ) + n m f n , n ≥ 1. {\displaystyle n\cdot b_{n}^{(m)}=(m-n+1)f_{1}b_{n-1}^{(m)}+(2m-n+2)f_{2}b_{n-2}^{(m)}+\cdots +((n-1)m-1)f_{n-1}b_{1}^{(m)}+nmf_{n},n\geq 1.}

Another formula for the coefficients, b n ( m ) {\displaystyle b_{n}^{(m)}} , is expanded by the Bell polynomials as

F ( z ) m = f 0 m + ∑ n ≥ 1 ( ∑ 1 ≤ k ≤ n ( m ) k f 0 m − k B n , k ( f 1 ⋅ 1 ! , f 2 ⋅ 2 ! , … , f n − k + 1 ⋅ ( n − k + 1 ) ! ) ) z n n ! , {\displaystyle F(z)^{m}=f_{0}^{m}+\sum _{n\geq 1}\left(\sum _{1\leq k\leq n}(m)_{k}f_{0}^{m-k}B_{n,k}{\big (}f_{1}\cdot 1!,f_{2}\cdot 2!,\ldots ,f_{n-k+1}\cdot (n-k+1)!{\big )}\right){\frac {z^{n}}{n!}},}

where ( r ) n {\displaystyle (r)_{n}} denotes the Pochhammer symbol.

If we let f 0 = 1 {\displaystyle f_{0}=1} and define q n := [ z n ] log ⁡ F ( z ) {\displaystyle q_{n}:=[z^{n}]\log F(z)} , then we have a power series expansion for the composite generating function given by

log ⁡ F ( z ) = f 1 z + 2 f 2 − f 1 2 2 z 2 + 3 f 3 − 3 f 1 f 2 + f 1 3 3 z 3 + … {\displaystyle \log F(z)=f_{1}z+{\frac {2f_{2}-f_{1}^{2}}{2}}z^{2}+{\frac {3f_{3}-3f_{1}f_{2}+f_{1}^{3}}{3}}z^{3}+\dots }

where the coefficients, q n {\displaystyle q_{n}} , in the previous expansion satisfy the recurrence relation given by

n ⋅ q n = n f n − ( n − 1 ) f 1 q n − 1 − ( n − 2 ) f 2 q n − 2 − ⋯ − f n − 1 q 1 , {\displaystyle n\cdot q_{n}=nf_{n}-(n-1)f_{1}q_{n-1}-(n-2)f_{2}q_{n-2}-\cdots -f_{n-1}q_{1},}

and a corresponding formula expanded by the Bell polynomials in the form of the power series coefficients of the following generating function:

log ⁡ F ( z ) = ∑ n ≥ 1 ( ∑ 1 ≤ k ≤ n ( − 1 ) k − 1 ( k − 1 ) ! B n , k ( f 1 ⋅ 1 ! , f 2 ⋅ 2 ! , … ) ) z n n ! . {\displaystyle \log F(z)=\sum _{n\geq 1}\left(\sum _{1\leq k\leq n}(-1)^{k-1}(k-1)!B_{n,k}(f_{1}\cdot 1!,f_{2}\cdot 2!,\ldots )\right){\frac {z^{n}}{n!}}.}

Let F ^ ( z ) {\displaystyle {\widehat {F}}(z)} denote the EGF of the sequence, { f n } n ≥ 0 {\displaystyle \{f_{n}\}_{n\geq 0}} , and suppose that G ^ ( z ) {\displaystyle {\widehat {G}}(z)} is the EGF of the sequence, { g n } n ≥ 0 {\displaystyle \{g_{n}\}_{n\geq 0}} . Faà di Bruno's formula implies that the sequence, { h n } n ≥ 0 {\displaystyle \{h_{n}\}_{n\geq 0}} , generated by the composition H ^ ( z ) := F ^ ( G ^ ( z ) ) {\displaystyle {\widehat {H}}(z):={\widehat {F}}({\widehat {G}}(z))} , can be expressed in terms of the exponential Bell polynomials as follows:

h n = ∑ 1 ≤ k ≤ n f k ⋅ B n , k ( g 1 , g 2 , ⋯ , g n − k + 1 ) + f 0 ⋅ δ n , 0 . {\displaystyle h_{n}=\sum _{1\leq k\leq n}f_{k}\cdot B_{n,k}(g_{1},g_{2},\cdots ,g_{n-k+1})+f_{0}\cdot \delta _{n,0}.}

We have the following integral formulas for a , b ∈ Z + {\displaystyle a,b\in \mathbb {Z} ^{+}} which can be applied termwise with respect to z {\displaystyle z} when z {\displaystyle z} is taken to be any formal power series variable:^[6]

∑ n ≥ 0 f n z n = ∫ 0 ∞ F ^ ( t z ) e − t d t = z − 1 L [ F ^ ] ( z − 1 ) {\displaystyle \sum _{n\geq 0}f_{n}z^{n}=\int _{0}^{\infty }{\widehat {F}}(tz)e^{-t}dt=z^{-1}{\mathcal {L}}[{\widehat {F}}](z^{-1})}

∑ n ≥ 0 Γ ( a n + b ) ⋅ f n z n = ∫ 0 ∞ t b − 1 e − t F ( t a z ) d t . {\displaystyle \sum _{n\geq 0}\Gamma (an+b)\cdot f_{n}z^{n}=\int _{0}^{\infty }t^{b-1}e^{-t}F(t^{a}z)dt.}

∑ n ≥ 0 f n n ! z n = 1 2 π ∫ − π π F ( z e − ı ϑ ) e e ı ϑ d ϑ . {\displaystyle \sum _{n\geq 0}{\frac {f_{n}}{n!}}z^{n}={\frac {1}{2\pi }}\int _{-\pi }^{\pi }F\left(ze^{-\imath \vartheta }\right)e^{e^{\imath \vartheta }}d\vartheta .}

Notice that the first and last of these integral formulas are used to convert between the EGF to the OGF of a sequence, and from the OGF to the EGF of a sequence whenever these integrals are convergent.

The first integral formula corresponds to the Laplace transform (or sometimes the formal Laplace–Borel transformation) of generating functions, denoted by L [ F ] ( z ) {\displaystyle {\mathcal {L}}[F](z)} , defined in.^[7] Other integral representations for the gamma function in the second of the previous formulas can of course also be used to construct similar integral transformations. One particular formula results in the case of the double factorial function example given immediately below in this section. The last integral formula is compared to Hankel's loop integral for the reciprocal gamma function applied termwise to the power series for F ( z ) {\displaystyle F(z)} .

The single factorial function, ( 2 n ) ! {\displaystyle (2n)!} , is expressed as a product of two double factorial functions of the form

( 2 n ) ! = ( 2 n ) ! ! × ( 2 n − 1 ) ! ! = 4 n ⋅ n ! π × Γ ( n + 1 2 ) , {\displaystyle (2n)!=(2n)!!\times (2n-1)!!={\frac {4^{n}\cdot n!}{\sqrt {\pi }}}\times \Gamma \left(n+{\frac {1}{2}}\right),}

where an integral for the double factorial function, or rational gamma function, is given by

1 2 ⋅ ( 2 n − 1 ) ! ! = 2 n 4 π Γ ( n + 1 2 ) = 1 2 π × ∫ 0 ∞ e − t 2 / 2 t 2 n d t , {\displaystyle {\frac {1}{2}}\cdot (2n-1)!!={\frac {2^{n}}{\sqrt {4\pi }}}\Gamma \left(n+{\frac {1}{2}}\right)={\frac {1}{\sqrt {2\pi }}}\times \int _{0}^{\infty }e^{-t^{2}/2}t^{2n}\,dt,}

for natural numbers n ≥ 0 {\displaystyle n\geq 0} . This integral representation of ( 2 n − 1 ) ! ! {\displaystyle (2n-1)!!} then implies that for fixed non-zero q ∈ C {\displaystyle q\in \mathbb {C} } and any integral powers k ≥ 0 {\displaystyle k\geq 0} , we have the formula

log ⁡ ( q ) k k ! = 1 ( 2 k ) ! × [ ∫ 0 ∞ 2 e − t 2 / 2 2 π ( 2 log ⁡ ( q ) ⋅ t ) 2 k d t ] . {\displaystyle {\frac {\log(q)^{k}}{k!}}={\frac {1}{(2k)!}}\times \left[\int _{0}^{\infty }{\frac {2e^{-t^{2}/2}}{\sqrt {2\pi }}}\left({\sqrt {2\log(q)}}\cdot t\right)^{2k}\,dt\right].}

Thus for any prescribed integer j ≥ 0 {\displaystyle j\geq 0} , we can use the previous integral representation together with the formula for extracting arithmetic progressions from a sequence OGF given above, to formulate the next integral representation for the so-termed modified Stirling number EGF as

∑ n ≥ 0 { 2 n j } log ⁡ ( q ) n n ! = ∫ 0 ∞ e − t 2 / 2 2 π ⋅ j ! [ ∑ b = ± 1 ( e b 2 log ⁡ ( q ) ⋅ t − 1 ) j ] d t , {\displaystyle \sum _{n\geq 0}\left\{{\begin{matrix}2n\\j\end{matrix}}\right\}{\frac {\log(q)^{n}}{n!}}=\int _{0}^{\infty }{\frac {e^{-t^{2}/2}}{{\sqrt {2\pi }}\cdot j!}}\left[\sum _{b=\pm 1}\left(e^{b{\sqrt {2\log(q)}}\cdot t}-1\right)^{j}\right]dt,}

which is convergent provided suitable conditions on the parameter 0 < | q | < 1 {\displaystyle 0<|q|<1} .^[8]

For fixed non-zero c , z ∈ C {\displaystyle c,z\in \mathbb {C} } defined such that | c z | < 1 {\displaystyle |cz|<1} , let the geometric series over the non-negative integral powers of ( c z ) n {\displaystyle (cz)^{n}} be denoted by G ( z ) := 1 / ( 1 − c z ) {\displaystyle G(z):=1/(1-cz)} . The corresponding higher-order j t h {\displaystyle j^{th}} derivatives of the geometric series with respect to z {\displaystyle z} are denoted by the sequence of functions

G j ( z ) := ( c z ) j 1 − c z × ( d d z ) ( j ) [ G ( z ) ] , {\displaystyle G_{j}(z):={\frac {(cz)^{j}}{1-cz}}\times \left({\frac {d}{dz}}\right)^{(j)}\left[G(z)\right],}

for non-negative integers j ≥ 0 {\displaystyle j\geq 0} . These j t h {\displaystyle j^{th}} derivatives of the ordinary geometric series can be shown, for example by induction, to satisfy an explicit closed-form formula given by

G j ( z ) = c 2 j z j j ! ( 1 − c z ) j + 2 {\displaystyle G_{j}(z)={\frac {c^{2j}z^{j}j!}{(1-cz)^{j+2}}}}

for any j ≥ 0 {\displaystyle j\geq 0} whenever | c z | < 1 {\displaystyle |cz|<1} . As an example of the third OGF ⟼ {\displaystyle \longmapsto } EGF conversion formula cited above, we can compute the following corresponding exponential forms of the generating functions G j ( z ) {\displaystyle G_{j}(z)} :

G ^ j ( z ) = 1 2 π ∫ − π π G j ( z e − i t ) e i t d t = c 2 j z j e c z j + 1 ( j + 1 + c z ) {\displaystyle {\widehat {G}}_{j}(z)={\frac {1}{2\pi }}\int _{-\pi }^{\pi }G_{j}\left(ze^{-it}\right)e^{it}\,dt={\frac {c^{2j}z^{j}e^{cz}}{j+1}}\left(j+1+cz\right)}

Fractional integrals and fractional derivatives (see the main article) form another generalized class of integration and differentiation operations that can be applied to the OGF of a sequence to form the corresponding OGF of a transformed sequence. For ℜ ( α ) > 0 {\displaystyle \Re (\alpha )>0} we define the fractional integral operator (of order α {\displaystyle \alpha } ) by the integral transformation^[9]

I α F ( z ) = 1 Γ ( α ) ∫ 0 z ( z − t ) α − 1 F ( t ) d t , {\displaystyle I^{\alpha }F(z)={\frac {1}{\Gamma (\alpha )}}\int _{0}^{z}(z-t)^{\alpha -1}F(t)dt,}

which corresponds to the (formal) power series given by

I α F ( z ) = ∑ n ≥ 0 n ! Γ ( n + α + 1 ) f n z n + α . {\displaystyle I^{\alpha }F(z)=\sum _{n\geq 0}{\frac {n!}{\Gamma (n+\alpha +1)}}f_{n}z^{n+\alpha }.}

For fixed α , β ∈ C {\displaystyle \alpha ,\beta \in \mathbb {C} } defined such that ℜ ( α ) , ℜ ( β ) > 0 {\displaystyle \Re (\alpha ),\Re (\beta )>0} , we have that the operators I α I β = I α + β {\displaystyle I^{\alpha }I^{\beta }=I^{\alpha +\beta }} . Moreover, for fixed α ∈ C {\displaystyle \alpha \in \mathbb {C} } and integers n {\displaystyle n} satisfying 0 < ℜ ( α ) < n {\displaystyle 0<\Re (\alpha )<n} we can define the notion of the fractional derivative satisfying the properties that

D α F ( z ) = d ( n ) d z ( n ) I n − α F ( z ) , {\displaystyle D^{\alpha }F(z)={\frac {d^{(n)}}{dz^{(n)}}}I^{n-\alpha }F(z),}

and

D k I α = D n I α + n − k {\displaystyle D^{k}I^{\alpha }=D^{n}I^{\alpha +n-k}} for k = 1 , 2 , … , n , {\displaystyle k=1,2,\ldots ,n,}

where we have the semigroup property that D α D β = D α + β {\displaystyle D^{\alpha }D^{\beta }=D^{\alpha +\beta }} only when none of α , β , α + β {\displaystyle \alpha ,\beta ,\alpha +\beta } is integer-valued.

For fixed s ∈ Z + {\displaystyle s\in \mathbb {Z} ^{+}} , we have that (compare to the special case of the integral formula for the Nielsen generalized polylogarithm function defined in^[10]) ^[11]

∑ n ≥ 0 f n ( n + 1 ) s z n = ( − 1 ) s − 1 ( s − 1 ) ! ∫ 0 1 log s − 1 ⁡ ( t ) F ( t z ) d t . {\displaystyle \sum _{n\geq 0}{\frac {f_{n}}{(n+1)^{s}}}z^{n}={\frac {(-1)^{s-1}}{(s-1)!}}\int _{0}^{1}\log ^{s-1}(t)F(tz)dt.}

Notice that if we set g n ≡ f n + 1 {\displaystyle g_{n}\equiv f_{n+1}} , the integral with respect to the generating function, G ( z ) {\displaystyle G(z)} , in the last equation when z ≡ 1 {\displaystyle z\equiv 1} corresponds to the Dirichlet generating function, or DGF, F ~ ( s ) {\displaystyle {\widetilde {F}}(s)} , of the sequence of { f n } {\displaystyle \{f_{n}\}} provided that the integral converges. This class of polylogarithm-related integral transformations is related to the derivative-based zeta series transformations defined in the next sections.

For fixed non-zero q , c , z ∈ C {\displaystyle q,c,z\in \mathbb {C} } such that | q | < 1 {\displaystyle |q|<1} and | c z | < 1 {\displaystyle |cz|<1} , we have the following integral representations for the so-termed square series generating function associated with the sequence { f n } {\displaystyle \{f_{n}\}} , which can be integrated termwise with respect to z {\displaystyle z} :^[12]

∑ n ≥ 0 q n 2 f n ⋅ ( c z ) n = 1 2 π ∫ 0 ∞ e − t 2 / 2 [ F ( e t 2 log ⁡ ( q ) ⋅ c z ) + F ( e − t 2 log ⁡ ( q ) ⋅ c z ) ] d t . {\displaystyle \sum _{n\geq 0}q^{n^{2}}f_{n}\cdot (cz)^{n}={\frac {1}{\sqrt {2\pi }}}\int _{0}^{\infty }e^{-t^{2}/2}\left[F\left(e^{t{\sqrt {2\log(q)}}}\cdot cz\right)+F\left(e^{-t{\sqrt {2\log(q)}}}\cdot cz\right)\right]dt.}

This result, which is proved in the reference, follows from a variant of the double factorial function transformation integral for the Stirling numbers of the second kind given as an example above. In particular, since

q n 2 = exp ⁡ ( n 2 ⋅ log ⁡ ( q ) ) = 1 + n 2 log ⁡ ( q ) + n 4 log ⁡ ( q ) 2 2 ! + n 6 log ⁡ ( q ) 3 3 ! + ⋯ , {\displaystyle q^{n^{2}}=\exp(n^{2}\cdot \log(q))=1+n^{2}\log(q)+n^{4}{\frac {\log(q)^{2}}{2!}}+n^{6}{\frac {\log(q)^{3}}{3!}}+\cdots ,}

we can use a variant of the positive-order derivative-based OGF transformations defined in the next sections involving the Stirling numbers of the second kind to obtain an integral formula for the generating function of the sequence, { S ( 2 n , j ) / n ! } {\displaystyle \left\{S(2n,j)/n!\right\}} , and then perform a sum over the j t h {\displaystyle j^{th}} derivatives of the formal OGF, F ( z ) {\displaystyle F(z)} to obtain the result in the previous equation where the arithmetic progression generating function at hand is denoted by

∑ n ≥ 0 { 2 n j } z 2 n ( 2 n ) ! = 1 2 j ! ( ( e z − 1 ) j + ( e − z − 1 ) j ) , {\displaystyle \sum _{n\geq 0}\left\{{\begin{matrix}2n\\j\end{matrix}}\right\}{\frac {z^{2n}}{(2n)!}}={\frac {1}{2j!}}\left((e^{z}-1)^{j}+(e^{-z}-1)^{j}\right),}

for each fixed j ∈ N {\displaystyle j\in \mathbb {N} } .

We have an integral representation for the Hadamard product of two generating functions, F ( z ) {\displaystyle F(z)} and G ( z ) {\displaystyle G(z)} , stated in the following form:

( F ⊙ G ) ( z ) := ∑ n ≥ 0 f n g n z n = 1 2 π ∫ 0 2 π F ( z e i t ) G ( z e − i t ) d t , {\displaystyle (F\odot G)(z):=\sum _{n\geq 0}f_{n}g_{n}z^{n}={\frac {1}{2\pi }}\int _{0}^{2\pi }F\left({\sqrt {z}}e^{it}\right)G\left({\sqrt {z}}e^{-it}\right)dt,}

where i is the imaginary unit.

More information about Hadamard products as diagonal generating functions of multivariate sequences and/or generating functions and the classes of generating functions these diagonal OGFs belong to is found in Stanley's book.^[13] The reference also provides nested coefficient extraction formulas of the form

diag ⁡ ( F 1 ⋯ F k ) := ∑ n ≥ 0 f 1 , n ⋯ f k , n z n = [ x k − 1 0 ⋯ x 2 0 x 1 0 ] F k ( z x k − 1 ) F k − 1 ( x k − 1 x k − 2 ) ⋯ F 2 ( x 2 x 1 ) F 1 ( x 1 ) , {\displaystyle \operatorname {diag} \left(F_{1}\cdots F_{k}\right):=\sum _{n\geq 0}f_{1,n}\cdots f_{k,n}z^{n}=[x_{k-1}^{0}\cdots x_{2}^{0}x_{1}^{0}]F_{k}\left({\frac {z}{x_{k-1}}}\right)F_{k-1}\left({\frac {x_{k-1}}{x_{k-2}}}\right)\cdots F_{2}\left({\frac {x_{2}}{x_{1}}}\right)F_{1}(x_{1}),}

which are particularly useful in the cases where the component sequence generating functions, F i ( z ) {\displaystyle F_{i}(z)} , can be expanded in a Laurent series, or fractional series, in z {\displaystyle z} , such as in the special case where all of the component generating functions are rational, which leads to an algebraic form of the corresponding diagonal generating function.

In general, the Hadamard product of two rational generating functions is itself rational.^[14] This is seen by noticing that the coefficients of a rational generating function form quasi-polynomial terms of the form

f n = p 1 ( n ) ρ 1 n + ⋯ + p ℓ ( n ) ρ ℓ n , {\displaystyle f_{n}=p_{1}(n)\rho _{1}^{n}+\cdots +p_{\ell }(n)\rho _{\ell }^{n},}

where the reciprocal roots, ρ i ∈ C {\displaystyle \rho _{i}\in \mathbb {C} } , are fixed scalars and where p i ( n ) {\displaystyle p_{i}(n)} is a polynomial in n {\displaystyle n} for all 1 ≤ i ≤ ℓ {\displaystyle 1\leq i\leq \ell } . For example, the Hadamard product of the two generating functions

F ( z ) := 1 1 + a 1 z + a 2 z 2 {\displaystyle F(z):={\frac {1}{1+a_{1}z+a_{2}z^{2}}}}

and

G ( z ) := 1 1 + b 1 z + b 2 z 2 {\displaystyle G(z):={\frac {1}{1+b_{1}z+b_{2}z^{2}}}}

is given by the rational generating function formula^[15]

( F ⊙ G ) ( z ) = 1 − a 2 b 2 z 2 1 − a 1 b 1 z + ( a 2 b 1 2 + a 1 2 b 2 − a 2 b 2 ) z 2 − a 1 a 2 b 1 b 2 z 3 + a 2 2 b 2 2 z 4 . {\displaystyle (F\odot G)(z)={\frac {1-a_{2}b_{2}z^{2}}{1-a_{1}b_{1}z+\left(a_{2}b_{1}^{2}+a_{1}^{2}b_{2}-a_{2}b_{2}\right)z^{2}-a_{1}a_{2}b_{1}b_{2}z^{3}+a_{2}^{2}b_{2}^{2}z^{4}}}.}

Ordinary generating functions for generalized factorial functions formed as special cases of the generalized rising factorial product functions, or Pochhammer k-symbol, defined by

p n ( α , R ) := R ( R + α ) ⋯ ( R + ( n − 1 ) α ) = α n ⋅ ( R α ) n , {\displaystyle p_{n}(\alpha ,R):=R(R+\alpha )\cdots (R+(n-1)\alpha )=\alpha ^{n}\cdot \left({\frac {R}{\alpha }}\right)_{n},}

where R {\displaystyle R} is fixed, α ≠ 0 {\displaystyle \alpha \neq 0} , and ( x ) n {\displaystyle (x)_{n}} denotes the Pochhammer symbol are generated (at least formally) by the Jacobi-type J-fractions (or special forms of continued fractions) established in the reference.^[16] If we let Conv h ⁡ ( α , R ; z ) := FP h ⁡ ( α , R ; z ) / FQ h ⁡ ( α , R ; z ) {\displaystyle \operatorname {Conv} _{h}(\alpha ,R;z):=\operatorname {FP} _{h}(\alpha ,R;z)/\operatorname {FQ} _{h}(\alpha ,R;z)} denote the h th {\displaystyle h^{\text{th}}} convergent to these infinite continued fractions where the component convergent functions are defined for all integers h ≥ 2 {\displaystyle h\geq 2} by

FP h ⁡ ( α , R ; z ) = ∑ n = 0 h − 1 [ ∑ k = 0 n ( h k ) ( 1 − h − R α ) k ( R α ) n − k ] ( α z ) n , {\displaystyle \operatorname {FP} _{h}(\alpha ,R;z)=\sum _{n=0}^{h-1}\left[\sum _{k=0}^{n}{\binom {h}{k}}\left(1-h-{\frac {R}{\alpha }}\right)_{k}\left({\frac {R}{\alpha }}\right)_{n-k}\right](\alpha z)^{n},}

and

FQ h ⁡ ( α , R ; z ) = ( − α z ) h ⋅ h ! × L h ( R / α − 1 ) ( ( α z ) − 1 ) = ∑ k = 0 h ( h k ) [ ∏ j = 0 k − 1 ( R + ( j − 1 − j ) α ) ] ( − z ) k , {\displaystyle {\begin{aligned}\operatorname {FQ} _{h}(\alpha ,R;z)&=(-\alpha z)^{h}\cdot h!\times L_{h}^{\left(R/\alpha -1\right)}\left((\alpha z)^{-1}\right)\\&=\sum _{k=0}^{h}{\binom {h}{k}}\left[\prod _{j=0}^{k-1}(R+(j-1-j)\alpha )\right](-z)^{k},\end{aligned}}}

where L n ( β ) ( x ) {\displaystyle L_{n}^{(\beta )}(x)} denotes an associated Laguerre polynomial, then we have that the h t h {\displaystyle h^{th}} convergent function, Conv h ⁡ ( α , R ; z ) {\displaystyle \operatorname {Conv} _{h}(\alpha ,R;z)} , exactly enumerates the product sequences, p n ( α , R ) {\displaystyle p_{n}(\alpha ,R)} , for all 0 ≤ n < 2 h {\displaystyle 0\leq n<2h} . For each h ≥ 2 {\displaystyle h\geq 2} , the h t h {\displaystyle h^{th}} convergent function is expanded as a finite sum involving only paired reciprocals of the Laguerre polynomials in the form of

Conv h ⁡ ( α , R ; z ) = ∑ i = 0 h − 1 ( R α + i − 1 i ) × ( − α z ) − 1 ( i + 1 ) ⋅ L i ( R / α − 1 ) ( ( α z ) − 1 ) L i + 1 ( R / α − 1 ) ( ( α z ) − 1 ) {\displaystyle \operatorname {Conv} _{h}(\alpha ,R;z)=\sum _{i=0}^{h-1}{\binom {{\frac {R}{\alpha }}+i-1}{i}}\times {\frac {(-\alpha z)^{-1}}{(i+1)\cdot L_{i}^{\left(R/\alpha -1\right)}\left((\alpha z)^{-1}\right)L_{i+1}^{\left(R/\alpha -1\right)}\left((\alpha z)^{-1}\right)}}}

Moreover, since the single factorial function is given by both n ! = p n ( 1 , 1 ) {\displaystyle n!=p_{n}(1,1)} and n ! = p n ( − 1 , n ) {\displaystyle n!=p_{n}(-1,n)} , we can generate the single factorial function terms using the approximate rational convergent generating functions up to order 2 h {\displaystyle 2h} . This observation suggests an approach to approximating the exact (formal) Laplace–Borel transform usually given in terms of the integral representation from the previous section by a Hadamard product, or diagonal-coefficient, generating function. In particular, given any OGF G ( z ) {\displaystyle G(z)} we can form the approximate Laplace transform, which is 2 h {\displaystyle 2h} -order accurate, by the diagonal coefficient extraction formula stated above given by

L ~ h [ G ] ( z ) := [ x 0 ] Conv h ⁡ ( 1 , 1 ; z x ) G ( x )   = 1 2 π ∫ 0 2 π Conv h ⁡ ( 1 , 1 ; z e I t ) G ( z e − I t ) d t . {\displaystyle {\begin{aligned}{\widetilde {\mathcal {L}}}_{h}[G](z)&:=[x^{0}]\operatorname {Conv} _{h}\left(1,1;{\frac {z}{x}}\right)G(x)\\&\ ={\frac {1}{2\pi }}\int _{0}^{2\pi }\operatorname {Conv} _{h}\left(1,1;{\sqrt {z}}e^{It}\right)G\left({\sqrt {z}}e^{-It}\right)dt.\end{aligned}}}

Examples of sequences enumerated through these diagonal coefficient generating functions arising from the sequence factorial function multiplier provided by the rational convergent functions include

n ! 2 = [ z n ] [ x 0 ] Conv h ⁡ ( − 1 , n ; z x ) Conv h ⁡ ( − 1 , n ; x ) , h ≥ n ( 2 n n ) = [ x 1 0 x 2 0 z n ] Conv h ⁡ ( − 2 , 2 n ; z x 2 ) Conv h ⁡ ( − 2 , 2 n − 1 ; x 2 x 1 ) I 0 ( 2 x 1 ) ( 3 n n ) ( 2 n n ) = [ x 1 0 x 2 0 z n ] Conv h ⁡ ( − 3 , 3 n − 1 ; 3 z x 2 ) Conv h ⁡ ( − 3 , 3 n − 2 ; x 2 x 1 ) I 0 ( 2 x 1 ) ! n = n ! × ∑ i = 0 n ( − 1 ) i i ! = [ z n x 0 ] ( e − x ( 1 − x ) Conv n ⁡ ( − 1 , n ; z x ) ) af ⁡ ( n ) = ∑ k = 1 n ( − 1 ) n − k k ! = [ z n ] ( Conv n ⁡ ( 1 , 1 ; z ) − 1 1 + z ) ( t − 1 ) n P n ( t + 1 t − 1 ) = ∑ k = 0 n ( n k ) 2 t k = [ x 1 0 x 2 0 ] [ z n ] ( Conv n ⁡ ( 1 , 1 ; z x 1 ) Conv n ⁡ ( 1 , 1 ; x 1 x 2 ) I 0 ( 2 t ⋅ x 2 ) I 0 ( 2 x 2 ) ) , n ≥ 1 ( 2 n − 1 ) ! ! = ∑ k = 1 n ( n − 1 ) ! ( k − 1 ) ! k ⋅ ( 2 k − 3 ) ! ! = [ x 1 0 x 2 0 x 3 n − 1 ] ( Conv n ⁡ ( 1 , 1 ; x 3 x 2 ) Conv n ⁡ ( 2 , 1 ; x 2 x 1 ) ( x 1 + 1 ) e x 1 ( 1 − x 2 ) ) , {\displaystyle {\begin{aligned}n!^{2}&=[z^{n}][x^{0}]\operatorname {Conv} _{h}\left(-1,n;{\frac {z}{x}}\right)\operatorname {Conv} _{h}\left(-1,n;x\right),h\geq n\\{\binom {2n}{n}}&=[x_{1}^{0}x_{2}^{0}z^{n}]\operatorname {Conv} _{h}\left(-2,2n;{\frac {z}{x_{2}}}\right)\operatorname {Conv} _{h}\left(-2,2n-1;{\frac {x_{2}}{x_{1}}}\right)I_{0}(2{\sqrt {x_{1}}})\\{\binom {3n}{n}}{\binom {2n}{n}}&=[x_{1}^{0}x_{2}^{0}z^{n}]\operatorname {Conv} _{h}\left(-3,3n-1;{\frac {3z}{x_{2}}}\right)\operatorname {Conv} _{h}\left(-3,3n-2;{\frac {x_{2}}{x_{1}}}\right)I_{0}(2{\sqrt {x_{1}}})\\!n&=n!\times \sum _{i=0}^{n}{\frac {(-1)^{i}}{i!}}=[z^{n}x^{0}]\left({\frac {e^{-x}}{(1-x)}}\operatorname {Conv} _{n}\left(-1,n;{\frac {z}{x}}\right)\right)\\\operatorname {af} (n)&=\sum _{k=1}^{n}(-1)^{n-k}k!=[z^{n}]\left({\frac {\operatorname {Conv} _{n}(1,1;z)-1}{1+z}}\right)\\(t-1)^{n}P_{n}\left({\frac {t+1}{t-1}}\right)&=\sum _{k=0}^{n}{\binom {n}{k}}^{2}t^{k}\\&=[x_{1}^{0}x_{2}^{0}][z^{n}]\left(\operatorname {Conv} _{n}\left(1,1;{\frac {z}{x_{1}}}\right)\operatorname {Conv} _{n}\left(1,1;{\frac {x_{1}}{x_{2}}}\right)I_{0}(2{\sqrt {t\cdot x_{2}}})I_{0}(2{\sqrt {x_{2}}})\right),n\geq 1\\(2n-1)!!&=\sum _{k=1}^{n}{\frac {(n-1)!}{(k-1)!}}k\cdot (2k-3)!!\\&=[x_{1}^{0}x_{2}^{0}x_{3}^{n-1}]\left(\operatorname {Conv} _{n}\left(1,1;{\frac {x_{3}}{x_{2}}}\right)\operatorname {Conv} _{n}\left(2,1;{\frac {x_{2}}{x_{1}}}\right){\frac {(x_{1}+1)e^{x_{1}}}{(1-x_{2})}}\right),\end{aligned}}}

where I 0 ( z ) {\displaystyle I_{0}(z)} denotes a modified Bessel function, ! n {\displaystyle !n} denotes the subfactorial function, af ⁡ ( n ) {\displaystyle \operatorname {af} (n)} denotes the alternating factorial function, and P n ( x ) {\displaystyle P_{n}(x)} is a Legendre polynomial. Other examples of sequences enumerated through applications of these rational Hadamard product generating functions given in the article include the Barnes G-function, combinatorial sums involving the double factorial function, sums of powers sequences, and sequences of binomials.

For fixed k ∈ Z + {\displaystyle k\in \mathbb {Z} ^{+}} , we have that if the sequence OGF F ( z ) {\displaystyle F(z)} has j t h {\displaystyle j^{th}} derivatives of all required orders for 1 ≤ j ≤ k {\displaystyle 1\leq j\leq k} , that the positive-order zeta series transformation is given by^[17]

∑ n ≥ 0 n k f n z n = ∑ j = 0 k { k j } z j F ( j ) ( z ) , {\displaystyle \sum _{n\geq 0}n^{k}f_{n}z^{n}=\sum _{j=0}^{k}\left\{{\begin{matrix}k\\j\end{matrix}}\right\}z^{j}F^{(j)}(z),}

where { n k } {\displaystyle \scriptstyle {\left\{{\begin{matrix}n\\k\end{matrix}}\right\}}} denotes a Stirling number of the second kind. In particular, we have the following special case identity when f n ≡ 1 ∀ n {\displaystyle f_{n}\equiv 1\forall n} when ⟨ n m ⟩ {\displaystyle \scriptstyle {\left\langle {\begin{matrix}n\\m\end{matrix}}\right\rangle }} denotes the triangle of first-order Eulerian numbers:^[18]

∑ n ≥ 0 n k z n = ∑ j = 0 k { k j } z j ⋅ j ! ( 1 − z ) j + 1 = 1 ( 1 − z ) k + 1 × ∑ 0 ≤ m < k ⟨ k m ⟩ z m + 1 . {\displaystyle \sum _{n\geq 0}n^{k}z^{n}=\sum _{j=0}^{k}\left\{{\begin{matrix}k\\j\end{matrix}}\right\}{\frac {z^{j}\cdot j!}{(1-z)^{j+1}}}={\frac {1}{(1-z)^{k+1}}}\times \sum _{0\leq m<k}\left\langle {\begin{matrix}k\\m\end{matrix}}\right\rangle z^{m+1}.}

We can also expand the negative-order zeta series transformations by a similar procedure to the above expansions given in terms of the j t h {\displaystyle j^{th}} -order derivatives of some F ( z ) ∈ C ∞ {\displaystyle F(z)\in C^{\infty }} and an infinite, non-triangular set of generalized Stirling numbers in reverse, or generalized Stirling numbers of the second kind defined within this context.

In particular, for integers k , j ≥ 0 {\displaystyle k,j\geq 0} , define these generalized classes of Stirling numbers of the second kind by the formula

{ k + 2 j } ∗ := 1 j ! × ∑ m = 1 j ( j m ) ( − 1 ) j − m m k . {\displaystyle \left\{{\begin{matrix}k+2\\j\end{matrix}}\right\}_{\ast }:={\frac {1}{j!}}\times \sum _{m=1}^{j}{\binom {j}{m}}{\frac {(-1)^{j-m}}{m^{k}}}.}

Then for k ∈ Z + {\displaystyle k\in \mathbb {Z} ^{+}} and some prescribed OGF, F ( z ) ∈ C ∞ {\displaystyle F(z)\in C^{\infty }} , i.e., so that the higher-order j t h {\displaystyle j^{th}} derivatives of F ( z ) {\displaystyle F(z)} exist for all j ≥ 0 {\displaystyle j\geq 0} , we have that

∑ n ≥ 1 f n n k z n = ∑ j ≥ 1 { k + 2 j } ∗ z j F ( j ) ( z ) . {\displaystyle \sum _{n\geq 1}{\frac {f_{n}}{n^{k}}}z^{n}=\sum _{j\geq 1}\left\{{\begin{matrix}k+2\\j\end{matrix}}\right\}_{\ast }z^{j}F^{(j)}(z).}

A table of the first few zeta series transformation coefficients, { k j } ∗ {\displaystyle \scriptstyle {\left\{{\begin{matrix}k\\j\end{matrix}}\right\}_{\ast }}} , appears below. These weighted-harmonic-number expansions are almost identical to the known formulas for the Stirling numbers of the first kind up to the leading sign on the weighted harmonic number terms in the expansions.

k	{ k j } ∗ × ( − 1 ) j − 1 j ! {\displaystyle \left\{{\begin{matrix}k\\j\end{matrix}}\right\}_{\ast }\times (-1)^{j-1}j!}
2	1 {\displaystyle 1}
3	H j {\displaystyle H_{j}}
4	1 2 ( H j 2 + H j ( 2 ) ) {\displaystyle {\frac {1}{2}}\left(H_{j}^{2}+H_{j}^{(2)}\right)}
5	1 6 ( H j 3 + 3 H j H j ( 2 ) + 2 H j ( 3 ) ) {\displaystyle {\frac {1}{6}}\left(H_{j}^{3}+3H_{j}H_{j}^{(2)}+2H_{j}^{(3)}\right)}
6	1 24 ( H j 4 + 6 H j 2 H j ( 2 ) + 3 ( H j ( 2 ) ) 2 + 8 H j H j ( 3 ) + 6 H j ( 4 ) ) {\displaystyle {\frac {1}{24}}\left(H_{j}^{4}+6H_{j}^{2}H_{j}^{(2)}+3\left(H_{j}^{(2)}\right)^{2}+8H_{j}H_{j}^{(3)}+6H_{j}^{(4)}\right)}

The next series related to the polylogarithm functions (the dilogarithm and trilogarithm functions, respectively), the alternating zeta function and the Riemann zeta function are formulated from the previous negative-order series results found in the references. In particular, when s := 2 {\displaystyle s:=2} (or equivalently, when k := 4 {\displaystyle k:=4} in the table above), we have the following special case series for the dilogarithm and corresponding constant value of the alternating zeta function:

Li 2 ( z ) = ∑ j ≥ 1 ( − 1 ) j − 1 2 ( H j 2 + H j ( 2 ) ) z j ( 1 − z ) j + 1 ζ ∗ ( 2 ) = π 2 12 = ∑ j ≥ 1 ( H j 2 + H j ( 2 ) ) 4 ⋅ 2 j . {\displaystyle {\begin{aligned}{\text{Li}}_{2}(z)&=\sum _{j\geq 1}{\frac {(-1)^{j-1}}{2}}\left(H_{j}^{2}+H_{j}^{(2)}\right){\frac {z^{j}}{(1-z)^{j+1}}}\\\zeta ^{\ast }(2)&={\frac {\pi ^{2}}{12}}=\sum _{j\geq 1}{\frac {\left(H_{j}^{2}+H_{j}^{(2)}\right)}{4\cdot 2^{j}}}.\end{aligned}}}

When s := 3 {\displaystyle s:=3} (or when k := 5 {\displaystyle k:=5} in the notation used in the previous subsection), we similarly obtain special case series for these functions given by

Li 3 ( z ) = ∑ j ≥ 1 ( − 1 ) j − 1 6 ( H j 3 + 3 H j H j ( 2 ) + 2 H j ( 3 ) ) z j ( 1 − z ) j + 1 ζ ∗ ( 3 ) = 3 4 ζ ( 3 ) = ∑ j ≥ 1 ( H j 3 + 3 H j H j ( 2 ) + 2 H j ( 3 ) ) 12 ⋅ 2 j = 1 6 log ⁡ ( 2 ) 3 + ∑ j ≥ 0 H j H j ( 2 ) 2 j + 1 . {\displaystyle {\begin{aligned}{\text{Li}}_{3}(z)&=\sum _{j\geq 1}{\frac {(-1)^{j-1}}{6}}\left(H_{j}^{3}+3H_{j}H_{j}^{(2)}+2H_{j}^{(3)}\right){\frac {z^{j}}{(1-z)^{j+1}}}\\\zeta ^{\ast }(3)&={\frac {3}{4}}\zeta (3)=\sum _{j\geq 1}{\frac {\left(H_{j}^{3}+3H_{j}H_{j}^{(2)}+2H_{j}^{(3)}\right)}{12\cdot 2^{j}}}\\&={\frac {1}{6}}\log(2)^{3}+\sum _{j\geq 0}{\frac {H_{j}H_{j}^{(2)}}{2^{j+1}}}.\end{aligned}}}

It is known that the first-order harmonic numbers have a closed-form exponential generating function expanded in terms of the natural logarithm, the incomplete gamma function, and the exponential integral given by

∑ n ≥ 0 H n n ! z n = e z ( E 1 ( z ) + γ + log ⁡ z ) = e z ( Γ ( 0 , z ) + γ + log ⁡ z ) . {\displaystyle \sum _{n\geq 0}{\frac {H_{n}}{n!}}z^{n}=e^{z}\left({\mbox{E}}_{1}(z)+\gamma +\log z\right)=e^{z}\left(\Gamma (0,z)+\gamma +\log z\right).}

Additional series representations for the r-order harmonic number exponential generating functions for integers r ≥ 2 {\displaystyle r\geq 2} are formed as special cases of these negative-order derivative-based series transformation results. For example, the second-order harmonic numbers have a corresponding exponential generating function expanded by the series

∑ n ≥ 0 H n ( 2 ) n ! z n = ∑ j ≥ 1 H j 2 + H j ( 2 ) 2 ⋅ ( j + 1 ) ! z j e z ( j + 1 + z ) . {\displaystyle \sum _{n\geq 0}{\frac {H_{n}^{(2)}}{n!}}z^{n}=\sum _{j\geq 1}{\frac {H_{j}^{2}+H_{j}^{(2)}}{2\cdot (j+1)!}}z^{j}e^{z}\left(j+1+z\right).}

A further generalization of the negative-order series transformations defined above is related to more Hurwitz-zeta-like, or Lerch-transcendent-like, generating functions. Specifically, if we define the even more general parametrized Stirling numbers of the second kind by

{ k + 2 j } ( α , β ) ∗ := 1 j ! × ∑ 0 ≤ m ≤ j ( j m ) ( − 1 ) j − m ( α m + β ) k {\displaystyle \left\{{\begin{matrix}k+2\\j\end{matrix}}\right\}_{(\alpha ,\beta )^{\ast }}:={\frac {1}{j!}}\times \sum _{0\leq m\leq j}{\binom {j}{m}}{\frac {(-1)^{j-m}}{(\alpha m+\beta )^{k}}}} ,

for non-zero α , β ∈ C {\displaystyle \alpha ,\beta \in \mathbb {C} } such that − β α ∉ Z + {\displaystyle -{\frac {\beta }{\alpha }}\notin \mathbb {Z} ^{+}} , and some fixed k ≥ 1 {\displaystyle k\geq 1} , we have that

∑ n ≥ 1 f n ( α n + β ) k z n = ∑ j ≥ 1 { k + 2 j } ( α , β ) ∗ z j F ( j ) ( z ) . {\displaystyle \sum _{n\geq 1}{\frac {f_{n}}{(\alpha n+\beta )^{k}}}z^{n}=\sum _{j\geq 1}\left\{{\begin{matrix}k+2\\j\end{matrix}}\right\}_{(\alpha ,\beta )^{\ast }}z^{j}F^{(j)}(z).}

Moreover, for any integers u , u 0 ≥ 0 {\displaystyle u,u_{0}\geq 0} , we have the partial series approximations to the full infinite series in the previous equation given by

∑ n = 1 u f n ( α n + β ) k z n = [ w u ] ( ∑ j = 1 u + u 0 { k + 2 j } ( α , β ) ∗ ( w z ) j F ( j ) ( w z ) 1 − w ) . {\displaystyle \sum _{n=1}^{u}{\frac {f_{n}}{(\alpha n+\beta )^{k}}}z^{n}=[w^{u}]\left(\sum _{j=1}^{u+u_{0}}\left\{{\begin{matrix}k+2\\j\end{matrix}}\right\}_{(\alpha ,\beta )^{\ast }}{\frac {(wz)^{j}F^{(j)}(wz)}{1-w}}\right).}

Series for special constants and zeta-related functions resulting from these generalized derivative-based series transformations typically involve the generalized r-order harmonic numbers defined by H n ( r ) ( α , β ) := ∑ 1 ≤ k ≤ n ( α k + β ) − r {\displaystyle H_{n}^{(r)}(\alpha ,\beta ):=\sum _{1\leq k\leq n}(\alpha k+\beta )^{-r}} for integers r ≥ 1 {\displaystyle r\geq 1} . A pair of particular series expansions for the following constants when n ∈ Z + {\displaystyle n\in \mathbb {Z} ^{+}} is fixed follow from special cases of BBP-type identities as

4 3 π 9 = ∑ j ≥ 0 8 9 j + 1 ( 2 ( j + 1 3 1 3 ) − 1 + 1 2 ( j + 2 3 2 3 ) − 1 ) log ⁡ ( n 2 − n + 1 n 2 ) = ∑ j ≥ 0 1 ( n 2 + 1 ) j + 1 ( 2 3 ⋅ ( j + 1 ) − n 2 ( j + 1 3 1 3 ) − 1 + n 2 ( j + 2 3 2 3 ) − 1 ) . {\displaystyle {\begin{aligned}{\frac {4{\sqrt {3}}\pi }{9}}&=\sum _{j\geq 0}{\frac {8}{9^{j+1}}}\left(2{\binom {j+{\frac {1}{3}}}{\frac {1}{3}}}^{-1}+{\frac {1}{2}}{\binom {j+{\frac {2}{3}}}{\frac {2}{3}}}^{-1}\right)\\\log \left({\frac {n^{2}-n+1}{n^{2}}}\right)&=\sum _{j\geq 0}{\frac {1}{(n^{2}+1)^{j+1}}}\left({\frac {2}{3\cdot (j+1)}}-n^{2}{\binom {j+{\frac {1}{3}}}{\frac {1}{3}}}^{-1}+{\frac {n}{2}}{\binom {j+{\frac {2}{3}}}{\frac {2}{3}}}^{-1}\right).\end{aligned}}}

Several other series for the zeta-function-related cases of the Legendre chi function, the polygamma function, and the Riemann zeta function include

χ 1 ( z ) = ∑ j ≥ 0 ( j + 1 2 1 2 ) − 1 z ⋅ ( − z 2 ) j ( 1 − z 2 ) j + 1 χ 2 ( z ) = ∑ j ≥ 0 ( j + 1 2 1 2 ) − 1 ( 1 + H j ( 1 ) ( 2 , 1 ) ) z ⋅ ( − z 2 ) j ( 1 − z 2 ) j + 1 ∑ k ≥ 0 ( − 1 ) k ( z + k ) 2 = ∑ j ≥ 0 ( j + z z ) − 1 ( 1 z 2 + 1 z H j ( 1 ) ( 2 , z ) ) 1 2 j + 1 13 18 ζ ( 3 ) = ∑ i = 1 , 2 ∑ j ≥ 0 ( j + i 3 i 3 ) − 1 ( 1 i 3 + 1 i 2 H j ( 1 ) ( 3 , i ) + 1 2 i ( H j ( 1 ) ( 3 , i ) 2 + H j ( 2 ) ( 3 , i ) ) ) ( − 1 ) i + 1 2 j + 1 . {\displaystyle {\begin{aligned}\chi _{1}(z)&=\sum _{j\geq 0}{\binom {j+{\frac {1}{2}}}{\frac {1}{2}}}^{-1}{\frac {z\cdot (-z^{2})^{j}}{(1-z^{2})^{j+1}}}\\\chi _{2}(z)&=\sum _{j\geq 0}{\binom {j+{\frac {1}{2}}}{\frac {1}{2}}}^{-1}\left(1+H_{j}^{(1)}(2,1)\right){\frac {z\cdot (-z^{2})^{j}}{(1-z^{2})^{j+1}}}\\\sum _{k\geq 0}{\frac {(-1)^{k}}{(z+k)^{2}}}&=\sum _{j\geq 0}{\binom {j+z}{z}}^{-1}\left({\frac {1}{z^{2}}}+{\frac {1}{z}}H_{j}^{(1)}(2,z)\right){\frac {1}{2^{j+1}}}\\{\frac {13}{18}}\zeta (3)&=\sum _{i=1,2}\sum _{j\geq 0}{\binom {j+{\frac {i}{3}}}{\frac {i}{3}}}^{-1}\left({\frac {1}{i^{3}}}+{\frac {1}{i^{2}}}H_{j}^{(1)}(3,i)+{\frac {1}{2i}}\left(H_{j}^{(1)}(3,i)^{2}+H_{j}^{(2)}(3,i)\right)\right){\frac {(-1)^{i+1}}{2^{j+1}}}.\end{aligned}}}

Additionally, we can give another new explicit series representation of the inverse tangent function through its relation to the Fibonacci numbers^[19] expanded as in the references by

tan − 1 ⁡ ( x ) = 5 2 ı × ∑ b = ± 1 ∑ j ≥ 0 b 5 ( j + 1 2 j ) − 1 [ ( b ı φ t / 5 ) j ( 1 − b ı φ t 5 ) j + 1 − ( b ı Φ t / 5 ) j ( 1 + b ı Φ t 5 ) j + 1 ] , {\displaystyle \tan ^{-1}(x)={\frac {\sqrt {5}}{2\imath }}\times \sum _{b=\pm 1}\sum _{j\geq 0}{\frac {b}{\sqrt {5}}}{\binom {j+{\frac {1}{2}}}{j}}^{-1}\left[{\frac {\left(b\imath \varphi t/{\sqrt {5}}\right)^{j}}{\left(1-{\frac {b\imath \varphi t}{\sqrt {5}}}\right)^{j+1}}}-{\frac {\left(b\imath \Phi t/{\sqrt {5}}\right)^{j}}{\left(1+{\frac {b\imath \Phi t}{\sqrt {5}}}\right)^{j+1}}}\right],}

for t ≡ 2 x / ( 1 + 1 + 4 5 x 2 ) {\displaystyle t\equiv 2x/\left(1+{\sqrt {1+{\frac {4}{5}}x^{2}}}\right)} and where the golden ratio (and its reciprocal) are respectively defined by φ , Φ := 1 2 ( 1 ± 5 ) {\displaystyle \varphi ,\Phi :={\frac {1}{2}}\left(1\pm {\sqrt {5}}\right)} .

An inversion relation is a pair of equations of the form

g n = ∑ k = 0 n A n , k ⋅ f k ⟷ f n = ∑ k = 0 n B n , k ⋅ g k , {\displaystyle g_{n}=\sum _{k=0}^{n}A_{n,k}\cdot f_{k}\quad \longleftrightarrow \quad f_{n}=\sum _{k=0}^{n}B_{n,k}\cdot g_{k},}

which is equivalent to the orthogonality relation

∑ k = j n A n , k ⋅ B k , j = δ n , j . {\displaystyle \sum _{k=j}^{n}A_{n,k}\cdot B_{k,j}=\delta _{n,j}.}

Given two sequences, { f n } {\displaystyle \{f_{n}\}} and { g n } {\displaystyle \{g_{n}\}} , related by an inverse relation of the previous form, we sometimes seek to relate the OGFs and EGFs of the pair of sequences by functional equations implied by the inversion relation. This goal in some respects mirrors the more number theoretic (Lambert series) generating function relation guaranteed by the Möbius inversion formula, which provides that whenever

a n = ∑ d | n b d ⟷ b n = ∑ d | n μ ( n d ) a d , {\displaystyle a_{n}=\sum _{d|n}b_{d}\quad \longleftrightarrow \quad b_{n}=\sum _{d|n}\mu \left({\frac {n}{d}}\right)a_{d},}

the generating functions for the sequences, { a n } {\displaystyle \{a_{n}\}} and { b n } {\displaystyle \{b_{n}\}} , are related by the Möbius transform given by

∑ n ≥ 1 a n z n = ∑ n ≥ 1 b n z n 1 − z n . {\displaystyle \sum _{n\geq 1}a_{n}z^{n}=\sum _{n\geq 1}{\frac {b_{n}z^{n}}{1-z^{n}}}.}

Similarly, the Euler transform of generating functions for two sequences, { a n } {\displaystyle \{a_{n}\}} and { b n } {\displaystyle \{b_{n}\}} , satisfying the relation^[20]

1 + ∑ n ≥ 1 b n z n = ∏ i ≥ 1 1 ( 1 − z i ) a i , {\displaystyle 1+\sum _{n\geq 1}b_{n}z^{n}=\prod _{i\geq 1}{\frac {1}{(1-z^{i})^{a_{i}}}},}

is given in the form of

1 + B ( z ) = exp ⁡ ( ∑ k ≥ 1 A ( z k ) k ) , {\displaystyle 1+B(z)=\exp \left(\sum _{k\geq 1}{\frac {A(z^{k})}{k}}\right),}

where the corresponding inversion formulas between the two sequences is given in the reference.

The remainder of the results and examples given in this section sketch some of the more well-known generating function transformations provided by sequences related by inversion formulas (the binomial transform and the Stirling transform), and provides several tables of known inversion relations of various types cited in Riordan's Combinatorial Identities book. In many cases, we omit the corresponding functional equations implied by the inversion relationships between two sequences (this part of the article needs more work).

This section needs expansion with: Need to add functional equations between generating functions related by the inversion pairs in the next subsections. For example, by exercise 5.71 of Concrete Mathematics, if s n = ∑ k ≥ 0 ( n + k m + 2 k ) a k {\displaystyle s_{n}=\sum _{k\geq 0}{\binom {n+k}{m+2k}}a_{k}} , then S ( z ) = z m ( 1 − z ) m + 1 A ( z ( 1 − z ) 2 ) {\displaystyle S(z)={\frac {z^{m}}{(1-z)^{m+1}}}A\left({\frac {z}{(1-z)^{2}}}\right)} . You can help by adding missing information. (March 2017)

The first inversion relation provided below implicit to the binomial transform is perhaps the simplest of all inversion relations we will consider in this section. For any two sequences, { f n } {\displaystyle \{f_{n}\}} and { g n } {\displaystyle \{g_{n}\}} , related by the inversion formulas

g n = ∑ k = 0 n ( n k ) ( − 1 ) k f k ⟷ f n = ∑ k = 0 n ( n k ) ( − 1 ) k g k , {\displaystyle g_{n}=\sum _{k=0}^{n}{\binom {n}{k}}(-1)^{k}f_{k}\quad \longleftrightarrow \quad f_{n}=\sum _{k=0}^{n}{\binom {n}{k}}(-1)^{k}g_{k},}

we have functional equations between the OGFs and EGFs of these sequences provided by the binomial transform in the forms of

G ( z ) = 1 1 − z F ( − z 1 − z ) {\displaystyle G(z)={\frac {1}{1-z}}F\left({\frac {-z}{1-z}}\right)}

and

G ^ ( z ) = e z F ^ ( − z ) . {\displaystyle {\widehat {G}}(z)=e^{z}{\widehat {F}}(-z).}

For any pair of sequences, { f n } {\displaystyle \{f_{n}\}} and { g n } {\displaystyle \{g_{n}\}} , related by the Stirling number inversion formula

g n = ∑ k = 1 n { n k } f k ⟷ f n = ∑ k = 1 n [ n k ] ( − 1 ) n − k g k , {\displaystyle g_{n}=\sum _{k=1}^{n}\left\{{\begin{matrix}n\\k\end{matrix}}\right\}f_{k}\quad \longleftrightarrow \quad f_{n}=\sum _{k=1}^{n}\left[{\begin{matrix}n\\k\end{matrix}}\right](-1)^{n-k}g_{k},}

these inversion relations between the two sequences translate into functional equations between the sequence EGFs given by the Stirling transform as

G ^ ( z ) = F ^ ( e z − 1 ) {\displaystyle {\widehat {G}}(z)={\widehat {F}}\left(e^{z}-1\right)}

and

F ^ ( z ) = G ^ ( log ⁡ ( 1 + z ) ) . {\displaystyle {\widehat {F}}(z)={\widehat {G}}\left(\log(1+z)\right).}

These tables appear in chapters 2 and 3 in Riordan's book providing an introduction to inverse relations with many examples, though which does not stress functional equations between the generating functions of sequences related by these inversion relations. The interested reader is encouraged to pick up a copy of the original book for more details.

Relation	Formula	Inverse Formula	Generating Functions (OGF)	Generating Functions (EGF)	Notes / References
1	a n = ∑ k = 0 n ( n k ) b k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {n}{k}}b_{k}}	b n = ∑ k = 0 n ( n k ) ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k=0}^{n}{\binom {n}{k}}(-1)^{n-k}a_{k}}	B ( z ) = 1 1 − z A ( − z 1 − z ) {\displaystyle B(z)={\frac {1}{1-z}}A\left(-{\frac {z}{1-z}}\right)}	B ^ ( z ) = e z A ^ ( − z ) {\displaystyle {\widehat {B}}(z)=e^{z}{\widehat {A}}(-z)}	See the Binomial transform
2	a n = ∑ k = 0 n ( p − k p − n ) b k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {p-k}{p-n}}b_{k}}	b n = ∑ k = 0 n ( p − k p − n ) ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k=0}^{n}{\binom {p-k}{p-n}}(-1)^{n-k}a_{k}}	∗ {\displaystyle \ast }	∗ {\displaystyle \ast }
3	a n = ∑ k = 0 n ( n + p k + p ) b k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {n+p}{k+p}}b_{k}}	b n = ∑ k = 0 n ( n + p k + p ) ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k=0}^{n}{\binom {n+p}{k+p}}(-1)^{n-k}a_{k}}	B ( z ) = 1 ( 1 + z ) p + 1 A ( z 1 + z ) {\displaystyle B(z)={\frac {1}{(1+z)^{p+1}}}A\left({\frac {z}{1+z}}\right)}	∗ {\displaystyle \ast }
4	a n = ∑ k ≥ n ( k + p n + p ) b k {\displaystyle a_{n}=\sum _{k\geq n}{\binom {k+p}{n+p}}b_{k}}	b n = ∑ k ≥ n ( k + p n + p ) ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k\geq n}{\binom {k+p}{n+p}}(-1)^{n-k}a_{k}}	∗ {\displaystyle \ast }	∗ {\displaystyle \ast }
5	a n = ∑ k = 1 n n ! k ! ( n − 1 k − 1 ) b k {\displaystyle a_{n}=\sum _{k=1}^{n}{\frac {n!}{k!}}{\binom {n-1}{k-1}}b_{k}}	b n = ∑ k = 1 n n ! k ! ( n − 1 k − 1 ) ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k=1}^{n}{\frac {n!}{k!}}{\binom {n-1}{k-1}}(-1)^{n-k}a_{k}}	∗ {\displaystyle \ast }	B ^ ( z ) = A ^ ( z 1 + z ) {\displaystyle {\widehat {B}}(z)={\widehat {A}}\left({\frac {z}{1+z}}\right)}
6	a n = ∑ k = 0 n ( n k ) 2 k ! b n − k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {n}{k}}^{2}k!b_{n-k}}	b n = ∑ k = 0 n ( n k ) 2 ( − 1 ) k k ! a n − k {\displaystyle b_{n}=\sum _{k=0}^{n}{\binom {n}{k}}^{2}(-1)^{k}k!a_{n-k}}	∗ {\displaystyle \ast }	B ^ ( z ) = 1 1 + z A ^ ( z 1 + z ) {\displaystyle {\widehat {B}}(z)={\frac {1}{1+z}}{\widehat {A}}\left({\frac {z}{1+z}}\right)}
7	n ! a n ( n + p ) ! = ∑ k = 0 n ( n k ) k ! b k ( k + p ) ! {\displaystyle {\frac {n!a_{n}}{(n+p)!}}=\sum _{k=0}^{n}{\binom {n}{k}}{\frac {k!b_{k}}{(k+p)!}}}	n ! b n ( n + p ) ! = ∑ k = 0 n ( n k ) ( − 1 ) n − k k ! a k ( k + p ) ! {\displaystyle {\frac {n!b_{n}}{(n+p)!}}=\sum _{k=0}^{n}{\binom {n}{k}}{\frac {(-1)^{n-k}k!a_{k}}{(k+p)!}}}	B ( z ) = 1 ( 1 + z ) p + 1 A ( z 1 + z ) {\displaystyle B(z)={\frac {1}{(1+z)^{p+1}}}A\left({\frac {z}{1+z}}\right)}	∗ {\displaystyle \ast }
8	s n = ∑ k ≥ 0 ( n + k m + 2 k ) a k {\displaystyle s_{n}=\sum _{k\geq 0}{\binom {n+k}{m+2k}}a_{k}}	∗ {\displaystyle \ast }	S ( z ) = z m ( 1 − z ) m + 1 A ( z ( 1 − z ) 2 ) {\displaystyle S(z)={\frac {z^{m}}{(1-z)^{m+1}}}A\left({\frac {z}{(1-z)^{2}}}\right)}	∗ {\displaystyle \ast }	See.[21]
9	a n = ∑ k = 0 n ( n k ) a k ( − c ) n − k b k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {n}{k}}a^{k}(-c)^{n-k}b_{k}}	∗ {\displaystyle \ast }	A ( z ) = 1 1 + c x B ( a x 1 + c x ) {\displaystyle A(z)={\frac {1}{1+cx}}B\left({\frac {ax}{1+cx}}\right)}	∗ {\displaystyle \ast }	Generalization of the binomial transform for a , b , c ∈ C {\displaystyle a,b,c\in \mathbb {C} } such that | a x 1 + c x | < σ B {\displaystyle \left|{\frac {ax}{1+cx}}\right|<\sigma _{B}} .
10	w n = ∑ i = 0 n ( n i ) k n a i ,   k ≠ 0 {\displaystyle w_{n}=\sum _{i=0}^{n}{\binom {n}{i}}k^{n}a_{i},\ k\neq 0}	∗ {\displaystyle \ast }	∗ {\displaystyle \ast }	W ^ ( A , k ; z ) = e k z A ^ ( k z ) {\displaystyle {\widehat {W}}(A,k;z)=e^{kz}{\widehat {A}}(kz)}	The k {\displaystyle k} -binomial transform (see [22])
11	f n = ∑ i = 0 n ( n i ) k n − i a i ,   k ≠ 0 {\displaystyle f_{n}=\sum _{i=0}^{n}{\binom {n}{i}}k^{n-i}a_{i},\ k\neq 0}	∗ {\displaystyle \ast }	∗ {\displaystyle \ast }	F ^ ( A , k ; z ) = e k z A ^ ( z ) {\displaystyle {\widehat {F}}(A,k;z)=e^{kz}{\widehat {A}}(z)}	The falling k {\displaystyle k} -binomial transform (refer to Spivey's article in [22])
12	r n = ∑ i = 0 n ( n i ) k i a i ,   k ≠ 0 {\displaystyle r_{n}=\sum _{i=0}^{n}{\binom {n}{i}}k^{i}a_{i},\ k\neq 0}	∗ {\displaystyle \ast }	∗ {\displaystyle \ast }	R ^ ( A , k ; z ) = e z A ^ ( k z ) {\displaystyle {\widehat {R}}(A,k;z)=e^{z}{\widehat {A}}(kz)}	The rising k {\displaystyle k} -binomial transform (refer to Spivey's article in [22])

The terms, A n , k {\displaystyle A_{n,k}} and B n , k {\displaystyle B_{n,k}} , in the inversion formulas of the form

a n = ∑ k A n , k ⋅ b k ⟷ b n = ∑ k B n , k ⋅ ( − 1 ) n − k a k , {\displaystyle a_{n}=\sum _{k}A_{n,k}\cdot b_{k}\quad \longleftrightarrow \quad b_{n}=\sum _{k}B_{n,k}\cdot (-1)^{n-k}a_{k},}

forming several special cases of Gould classes of inverse relations are given in the next table.

Class	A n , k {\displaystyle A_{n,k}}	B n , k {\displaystyle B_{n,k}}
1	( p + q k − k n − k ) {\displaystyle {\binom {p+qk-k}{n-k}}}	( p + q n − k n − k ) − q ( p + q n − k − 1 n − k − 1 ) {\displaystyle {\binom {p+qn-k}{n-k}}-q{\binom {p+qn-k-1}{n-k-1}}}
2	( p + q k − k n − k ) + q ( p + q k − k n − 1 − k ) {\displaystyle {\binom {p+qk-k}{n-k}}+q{\binom {p+qk-k}{n-1-k}}}	( p + q n − k n − k ) {\displaystyle {\binom {p+qn-k}{n-k}}}
3	( p + q n − n k − n ) {\displaystyle {\binom {p+qn-n}{k-n}}}	( p + q k − n k − n ) − q ( p + q k − n − 1 k − n − 1 ) {\displaystyle {\binom {p+qk-n}{k-n}}-q{\binom {p+qk-n-1}{k-n-1}}}
4	( p + q n − n k − n ) + q ( p + q n − n k − 1 − n ) {\displaystyle {\binom {p+qn-n}{k-n}}+q{\binom {p+qn-n}{k-1-n}}}	( p + q k − n k − n ) {\displaystyle {\binom {p+qk-n}{k-n}}}

For classes 1 and 2, the range on the sum satisfies k ∈ [ 0 , n ] {\displaystyle k\in [0,n]} , and for classes 3 and 4 the bounds on the summation are given by k = n , n + 1 , … {\displaystyle k=n,n+1,\ldots } . These terms are also somewhat simplified from their original forms in the table by the identities

( p + q n − k n − k ) − q × ( p + q n − k − 1 n − k − 1 ) = p + q k − k p + q n − k ( p + q n − k n − k ) {\displaystyle {\binom {p+qn-k}{n-k}}-q\times {\binom {p+qn-k-1}{n-k-1}}={\frac {p+qk-k}{p+qn-k}}{\binom {p+qn-k}{n-k}}}

( p + q k − k n − k ) + q × ( p + q k − k n − 1 − k ) = p + q n − n + 1 p + q k − n + 1 ( p + q k − k n − k ) . {\displaystyle {\binom {p+qk-k}{n-k}}+q\times {\binom {p+qk-k}{n-1-k}}={\frac {p+qn-n+1}{p+qk-n+1}}{\binom {p+qk-k}{n-k}}.}

The so-termed simpler cases of the Chebyshev classes of inverse relations in the subsection below are given in the next table.

Relation	Formula for a n {\displaystyle a_{n}}	Inverse Formula for b n {\displaystyle b_{n}}
1	a n = ∑ k ( n k ) b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n}{k}}b_{n-2k}}	b n = ∑ k [ ( n − k k ) + ( n − k − 1 k − 1 ) ] ( − 1 ) k a n − 2 k {\displaystyle b_{n}=\sum _{k}\left[{\binom {n-k}{k}}+{\binom {n-k-1}{k-1}}\right](-1)^{k}a_{n-2k}}
2	a n = ∑ k [ ( n k ) − ( n k − 1 ) ] b n − 2 k {\displaystyle a_{n}=\sum _{k}\left[{\binom {n}{k}}-{\binom {n}{k-1}}\right]b_{n-2k}}	b n = ∑ k ( n − k k ) ( − 1 ) k a n − 2 k {\displaystyle b_{n}=\sum _{k}{\binom {n-k}{k}}(-1)^{k}a_{n-2k}}
3	a n = ∑ k ( n + 2 k k ) b n + 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n+2k}{k}}b_{n+2k}}	b n = ∑ k [ ( n + k k ) + ( n + k − 1 k − 1 ) ] ( − 1 ) k a n + 2 k {\displaystyle b_{n}=\sum _{k}\left[{\binom {n+k}{k}}+{\binom {n+k-1}{k-1}}\right](-1)^{k}a_{n+2k}}
4	a n = ∑ k [ ( n + 2 k k ) − ( n + 2 k k − 1 ) ] b n + 2 k {\displaystyle a_{n}=\sum _{k}\left[{\binom {n+2k}{k}}-{\binom {n+2k}{k-1}}\right]b_{n+2k}}	b n = ∑ k ( n + 2 k k ) ( − 1 ) k a n + 2 k {\displaystyle b_{n}=\sum _{k}{\binom {n+2k}{k}}(-1)^{k}a_{n+2k}}
5	a n = ∑ k ( n − k k ) b n − k {\displaystyle a_{n}=\sum _{k}{\binom {n-k}{k}}b_{n-k}}	b n = ∑ k [ ( n + k − 1 k ) − ( n + k − 1 k − 1 ) ] ( − 1 ) k a n − k {\displaystyle b_{n}=\sum _{k}\left[{\binom {n+k-1}{k}}-{\binom {n+k-1}{k-1}}\right](-1)^{k}a_{n-k}}
6	a n = ∑ k [ ( n + 1 − k k ) + ( n − k k − 1 ) ] b n − k {\displaystyle a_{n}=\sum _{k}\left[{\binom {n+1-k}{k}}+{\binom {n-k}{k-1}}\right]b_{n-k}}	b n = ∑ k ( n + k k ) ( − 1 ) k a n − k {\displaystyle b_{n}=\sum _{k}{\binom {n+k}{k}}(-1)^{k}a_{n-k}}
7	a n = ∑ k = 0 n ( n k ) b n + c k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {n}{k}}b_{n+ck}}	b n = ∑ k ( n + c k + k k ) n ( − 1 ) k n + c k + k a n + c k {\displaystyle b_{n}=\sum _{k}{\binom {n+ck+k}{k}}{\frac {n(-1)^{k}}{n+ck+k}}a_{n+ck}}

The formulas in the table are simplified somewhat by the following identities:

( n − k k ) + ( n − k − 1 k − 1 ) = n n − k ( n − k k ) ( n k ) − ( n k − 1 ) = n + 1 − k n + 1 − 2 k ( n k ) ( n + 2 k k ) − ( n + 2 k k − 1 ) = n + 1 n + 1 + k ( n + 2 k k ) ( n + k − 1 k ) − ( n + k − 1 k − 1 ) = n − k n + k ( n + k k ) . {\displaystyle {\begin{aligned}{\binom {n-k}{k}}+{\binom {n-k-1}{k-1}}&={\frac {n}{n-k}}{\binom {n-k}{k}}\\{\binom {n}{k}}-{\binom {n}{k-1}}&={\frac {n+1-k}{n+1-2k}}{\binom {n}{k}}\\{\binom {n+2k}{k}}-{\binom {n+2k}{k-1}}&={\frac {n+1}{n+1+k}}{\binom {n+2k}{k}}\\{\binom {n+k-1}{k}}-{\binom {n+k-1}{k-1}}&={\frac {n-k}{n+k}}{\binom {n+k}{k}}.\end{aligned}}}

Additionally the inversion relations given in the table also hold when n ⟼ n + p {\displaystyle n\longmapsto n+p} in any given relation.

The terms, A n , k {\displaystyle A_{n,k}} and B n , k {\displaystyle B_{n,k}} , in the inversion formulas of the form

a n = ∑ k A n , k ⋅ b n + c k ⟷ b n = ∑ k B n , k ⋅ ( − 1 ) k a n + c k , {\displaystyle a_{n}=\sum _{k}A_{n,k}\cdot b_{n+ck}\quad \longleftrightarrow \quad b_{n}=\sum _{k}B_{n,k}\cdot (-1)^{k}a_{n+ck},}

for non-zero integers c {\displaystyle c} forming several special cases of Chebyshev classes of inverse relations are given in the next table.

Class	A n , k {\displaystyle A_{n,k}}	B n , k {\displaystyle B_{n,k}}
1	( n k ) {\displaystyle {\binom {n}{k}}}	( n + c k + k k ) − ( c + 1 ) ( n + c k + k − 1 k − 1 ) {\displaystyle {\binom {n+ck+k}{k}}-(c+1){\binom {n+ck+k-1}{k-1}}}
2	( n k ) + ( c + 1 ) ( n k − 1 ) {\displaystyle {\binom {n}{k}}+(c+1){\binom {n}{k-1}}}	( n + c k + k k ) {\displaystyle {\binom {n+ck+k}{k}}}
3	( n + c k k ) {\displaystyle {\binom {n+ck}{k}}}	( n − 1 + k k ) + c ( n − 1 + k k − 1 ) {\displaystyle {\binom {n-1+k}{k}}+c{\binom {n-1+k}{k-1}}}
4	( n + c k k ) − ( c − 1 ) ( n + c k k − 1 ) {\displaystyle {\binom {n+ck}{k}}-(c-1){\binom {n+ck}{k-1}}}	( n + k k ) {\displaystyle {\binom {n+k}{k}}}

Additionally, these inversion relations also hold when n ⟼ n + p {\displaystyle n\longmapsto n+p} for some p = 0 , 1 , 2 , … , {\displaystyle p=0,1,2,\ldots ,} or when the sign factor of ( − 1 ) k {\displaystyle (-1)^{k}} is shifted from the terms B n , k {\displaystyle B_{n,k}} to the terms A n , k {\displaystyle A_{n,k}} . The formulas given in the previous table are simplified somewhat by the identities

( n + c k + k k ) − ( c + 1 ) ( n + c k + k − 1 k − 1 ) = n n + c k + k ( n + c k + k k ) ( n k ) + ( c + 1 ) ( n k − 1 ) = n + 1 + c k n + 1 − k ( n k ) ( n − 1 + k k ) + c ( n − 1 + k k − 1 ) = n + c k n ( n − 1 + k k ) ( n + c k k ) − ( c − 1 ) ( n + c k k − 1 ) = n + 1 n + 1 + c k − k ( n + c k k ) . {\displaystyle {\begin{aligned}{\binom {n+ck+k}{k}}-(c+1){\binom {n+ck+k-1}{k-1}}&={\frac {n}{n+ck+k}}{\binom {n+ck+k}{k}}\\{\binom {n}{k}}+(c+1){\binom {n}{k-1}}&={\frac {n+1+ck}{n+1-k}}{\binom {n}{k}}\\{\binom {n-1+k}{k}}+c{\binom {n-1+k}{k-1}}&={\frac {n+ck}{n}}{\binom {n-1+k}{k}}\\{\binom {n+ck}{k}}-(c-1){\binom {n+ck}{k-1}}&={\frac {n+1}{n+1+ck-k}}{\binom {n+ck}{k}}.\end{aligned}}}

Relation	Formula for a n {\displaystyle a_{n}}	Inverse Formula for b n {\displaystyle b_{n}}
1	a n = ∑ k ( n + p + k n − k ) b k {\displaystyle a_{n}=\sum _{k}{\binom {n+p+k}{n-k}}b_{k}}	b n = ∑ k [ ( 2 n + p n − k ) − ( 2 n + p n − k − 1 ) ] ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k}\left[{\binom {2n+p}{n-k}}-{\binom {2n+p}{n-k-1}}\right](-1)^{n-k}a_{k}}
2	a n = ∑ k ( 2 n + p n − k ) b k {\displaystyle a_{n}=\sum _{k}{\binom {2n+p}{n-k}}b_{k}}	b n = ∑ k [ ( n + p + k n − k ) − ( n + p + k − 1 n − k − 1 ) ] ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k}\left[{\binom {n+p+k}{n-k}}-{\binom {n+p+k-1}{n-k-1}}\right](-1)^{n-k}a_{k}}
3	a n = ∑ k ≥ n ( n + p + k k − n ) b k {\displaystyle a_{n}=\sum _{k\geq n}{\binom {n+p+k}{k-n}}b_{k}}	b n = ∑ k ≥ n [ ( 2 k + p k − n ) − ( 2 k + p k − n − 1 ) ] ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k\geq n}\left[{\binom {2k+p}{k-n}}-{\binom {2k+p}{k-n-1}}\right](-1)^{n-k}a_{k}}
4	a n = ∑ k ≥ n ( 2 k + p k − n ) b k {\displaystyle a_{n}=\sum _{k\geq n}{\binom {2k+p}{k-n}}b_{k}}	b n = ∑ k ≥ n [ ( n + p + k k − n ) − ( n + p + k − 1 k − n − 1 ) ] ( − 1 ) n − k a k {\displaystyle b_{n}=\sum _{k\geq n}\left[{\binom {n+p+k}{k-n}}-{\binom {n+p+k-1}{k-n-1}}\right](-1)^{n-k}a_{k}}
5	a n = ∑ k ( 2 n + p k ) b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {2n+p}{k}}b_{n-2k}}	b n = ∑ k [ ( 2 n + p − 3 k k ) + 3 ( 2 n + p − 3 k − 1 k − 1 ) ] ( − 1 ) k a n − 2 k {\displaystyle b_{n}=\sum _{k}\left[{\binom {2n+p-3k}{k}}+3{\binom {2n+p-3k-1}{k-1}}\right](-1)^{k}a_{n-2k}}
6	a n = ∑ k [ ( 2 n + p k ) − 3 ( 2 n + p k − 1 ) ] b n − 2 k {\displaystyle a_{n}=\sum _{k}\left[{\binom {2n+p}{k}}-3{\binom {2n+p}{k-1}}\right]b_{n-2k}}	b n = ∑ k ( 2 n + p − 3 k k ) ( − 1 ) k a n − 2 k {\displaystyle b_{n}=\sum _{k}{\binom {2n+p-3k}{k}}(-1)^{k}a_{n-2k}}
7	a n = ∑ k = 0 [ n / 2 ] ( 3 n k ) b n − 2 k {\displaystyle a_{n}=\sum _{k=0}^{[n/2]}{\binom {3n}{k}}b_{n-2k}}	b n = ∑ k = 0 [ n / 2 ] [ ( 3 n − 5 k k ) + 5 ( 3 n − 5 k − 1 k − 1 ) ] ( − 1 ) k a n − 2 k {\displaystyle b_{n}=\sum _{k=0}^{[n/2]}\left[{\binom {3n-5k}{k}}+5{\binom {3n-5k-1}{k-1}}\right](-1)^{k}a_{n-2k}}
8	a n = ∑ k = 0 [ n / 3 ] ( 2 n k ) b n − 3 k {\displaystyle a_{n}=\sum _{k=0}^{[n/3]}{\binom {2n}{k}}b_{n-3k}}	b n = ∑ k = 0 [ n / 3 ] [ ( 2 n − 5 k k ) + 5 ( 2 n − 5 k − 1 k − 1 ) ] ( − 1 ) k a n − 3 k {\displaystyle b_{n}=\sum _{k=0}^{[n/3]}\left[{\binom {2n-5k}{k}}+5{\binom {2n-5k-1}{k-1}}\right](-1)^{k}a_{n-3k}}

The Legendre–Chebyshev classes of inverse relations correspond to inversion relations of the form

a n = ∑ k A n , k ⋅ b k ⟷ b n = ∑ k B n , k ⋅ ( − 1 ) n − k a k , {\displaystyle a_{n}=\sum _{k}A_{n,k}\cdot b_{k}\quad \longleftrightarrow \quad b_{n}=\sum _{k}B_{n,k}\cdot (-1)^{n-k}a_{k},}

where the terms, A n , k {\displaystyle A_{n,k}} and B n , k {\displaystyle B_{n,k}} , implicitly depend on some fixed non-zero c ∈ Z {\displaystyle c\in \mathbb {Z} } . In general, given a class of Chebyshev inverse pairs of the form

a n = ∑ k A n , k ⋅ b n − c k ⟷ b n = ∑ k B n , k ⋅ ( − 1 ) k a n − c k , {\displaystyle a_{n}=\sum _{k}A_{n,k}\cdot b_{n-ck}\quad \longleftrightarrow \quad b_{n}=\sum _{k}B_{n,k}\cdot (-1)^{k}a_{n-ck},}

if c {\displaystyle c} a prime, the substitution of n ⟼ c n + p {\displaystyle n\longmapsto cn+p} , a c n + p ⟼ A n {\displaystyle a_{cn+p}\longmapsto A_{n}} , and b c n + p ⟼ B n {\displaystyle b_{cn+p}\longmapsto B_{n}} (possibly replacing k ⟼ n − k {\displaystyle k\longmapsto n-k} ) leads to a Legendre–Chebyshev pair of the form^[23]

A n = ∑ k A c n + p , k B n − k ⟷ B n = ∑ k B c n + p , k ( − 1 ) k A n − k . {\displaystyle A_{n}=\sum _{k}A_{cn+p,k}B_{n-k}\quad \longleftrightarrow \quad B_{n}=\sum _{k}B_{cn+p,k}(-1)^{k}A_{n-k}.}

Similarly, if the positive integer c := d e {\displaystyle c:=de} is composite, we can derive inversion pairs of the form

A n = ∑ k A d n + p , k B n − e k ⟷ B n = ∑ k B d n + p , k ( − 1 ) k A n − e k . {\displaystyle A_{n}=\sum _{k}A_{dn+p,k}B_{n-ek}\quad \longleftrightarrow \quad B_{n}=\sum _{k}B_{dn+p,k}(-1)^{k}A_{n-ek}.}

The next table summarizes several generalized classes of Legendre–Chebyshev inverse relations for some non-zero integer c {\displaystyle c} .

Class	A n , k {\displaystyle A_{n,k}}	B n , k {\displaystyle B_{n,k}}
1	( c n + p n − k ) {\displaystyle {\binom {cn+p}{n-k}}}	( n + p − 1 + c k − k n − k ) + c ( n + p − 1 + c k − k n − k − 1 ) {\displaystyle {\binom {n+p-1+ck-k}{n-k}}+c{\binom {n+p-1+ck-k}{n-k-1}}}
2	( c n + p k − n ) {\displaystyle {\binom {cn+p}{k-n}}}	( c k + k + p − n − 1 k − n ) − c ( c k + k + p − n − 1 k − n − 1 ) {\displaystyle {\binom {ck+k+p-n-1}{k-n}}-c{\binom {ck+k+p-n-1}{k-n-1}}}
3	( c k + p n − p ) {\displaystyle {\binom {ck+p}{n-p}}}	( c n + n + p − k − 1 n − k ) − c ( c n + n + p − k − 1 n − k − 1 ) {\displaystyle {\binom {cn+n+p-k-1}{n-k}}-c{\binom {cn+n+p-k-1}{n-k-1}}}
4	( c k + p k − n ) {\displaystyle {\binom {ck+p}{k-n}}}	( c n − n + p + k − 1 k − n ) + c ( c n − n + p + k − 1 k − n − 1 ) {\displaystyle {\binom {cn-n+p+k-1}{k-n}}+c{\binom {cn-n+p+k-1}{k-n-1}}}
5	( c n + p n − k ) − ( c − 1 ) ( c n + p n − k − 1 ) {\displaystyle {\binom {cn+p}{n-k}}-(c-1){\binom {cn+p}{n-k-1}}}	( n + p + c k − k n − k ) {\displaystyle {\binom {n+p+ck-k}{n-k}}}
6	( c n + p k − n ) + ( c + 1 ) ( c n + p k − n − 1 ) {\displaystyle {\binom {cn+p}{k-n}}+(c+1){\binom {cn+p}{k-n-1}}}	( c k + k + p − n k − n ) {\displaystyle {\binom {ck+k+p-n}{k-n}}}
7	( c k + p n − k ) + ( c + 1 ) ( c k + p n − k − 1 ) {\displaystyle {\binom {ck+p}{n-k}}+(c+1){\binom {ck+p}{n-k-1}}}	( c n + n + p − k n − k ) {\displaystyle {\binom {cn+n+p-k}{n-k}}}
8	( c k + p k − n ) − ( c − 1 ) ( c k + p k − n − 1 ) {\displaystyle {\binom {ck+p}{k-n}}-(c-1){\binom {ck+p}{k-n-1}}}	( c n − n + p + k k − n ) {\displaystyle {\binom {cn-n+p+k}{k-n}}}

Abel inverse relations correspond to Abel inverse pairs of the form

a n = ∑ k = 0 n ( n k ) A n k b k ⟷ b n = ∑ k = 0 n ( n k ) B n k ( − 1 ) n − k a k , {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {n}{k}}A_{nk}b_{k}\quad \longleftrightarrow \quad b_{n}=\sum _{k=0}^{n}{\binom {n}{k}}B_{nk}(-1)^{n-k}a_{k},}

where the terms, A n k {\displaystyle A_{nk}} and B n k {\displaystyle B_{nk}} , may implicitly vary with some indeterminate summation parameter x {\displaystyle x} . These relations also still hold if the binomial coefficient substitution of ( n k ) ⟼ ( n + p k + p ) {\displaystyle {\binom {n}{k}}\longmapsto {\binom {n+p}{k+p}}} is performed for some non-negative integer p {\displaystyle p} . The next table summarizes several notable forms of these Abel inverse relations.

Number	A n k {\displaystyle A_{nk}}	B n k {\displaystyle B_{nk}}	Generating Function Identity
1	x ( x + n − k ) n − k − 1 {\displaystyle x(x+n-k)^{n-k-1}}	x ( x − n + k ) n − k − 1 {\displaystyle x(x-n+k)^{n-k-1}}	∗ {\displaystyle \ast }
2	( x + n − k ) n − k {\displaystyle (x+n-k)^{n-k}}	( x 2 − n + k ) ( x − n + k ) n − k − 2 {\displaystyle (x^{2}-n+k)(x-n+k)^{n-k-2}}	∗ {\displaystyle \ast }
3	( x + k ) n − k {\displaystyle (x+k)^{n-k}}	( x + k ) ( x + n ) n − k − 1 {\displaystyle (x+k)(x+n)^{n-k-1}}	∗ {\displaystyle \ast }
3a	( x + n ) ( x + k ) n − k − 1 {\displaystyle (x+n)(x+k)^{n-k-1}}	( x + n ) n − k {\displaystyle (x+n)^{n-k}}	∗ {\displaystyle \ast }
4	( x + 2 n ) ( x + n + k ) n − k − 1 {\displaystyle (x+2n)(x+n+k)^{n-k-1}}	( x + 2 n ) ( x + n + k ) n − k − 1 {\displaystyle (x+2n)(x+n+k)^{n-k-1}}	∗ {\displaystyle \ast }
4a	( x + 2 k ) ( x + n + k ) n − k − 1 {\displaystyle (x+2k)(x+n+k)^{n-k-1}}	( x + 2 k ) ( x + n + k ) n − k − 1 {\displaystyle (x+2k)(x+n+k)^{n-k-1}}	∗ {\displaystyle \ast }
5	( n + k ) n − k {\displaystyle (n+k)^{n-k}}	[ n + k ( 4 n − 1 ) ] ( n + k ) n − k − 2 {\displaystyle \left[n+k(4n-1)\right](n+k)^{n-k-2}}	∗ {\displaystyle \ast }

If we let the convolved Fibonacci numbers, f k ( ± p ) {\displaystyle f_{k}^{(\pm p)}} , be defined by

f n ( p ) = ∑ j ≥ 0 ( p + n − j − 1 n − j ) ( n − j j ) f n ( − p ) = ∑ j ≥ 0 ( p n + j ) ( n − j j ) ( − 1 ) n − j , {\displaystyle {\begin{aligned}f_{n}^{(p)}&=\sum _{j\geq 0}{\binom {p+n-j-1}{n-j}}{\binom {n-j}{j}}\\f_{n}^{(-p)}&=\sum _{j\geq 0}{\binom {p}{n+j}}{\binom {n-j}{j}}(-1)^{n-j},\end{aligned}}}

we have the next table of inverse relations which are obtained from properties of ordinary sequence generating functions proved as in section 3.3 of Riordan's book.

Relation	Formula for a n {\displaystyle a_{n}}	Inverse Formula for b n {\displaystyle b_{n}}
1	a n = ∑ k = 0 n ( p + k k ) b n − k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {p+k}{k}}b_{n-k}}	b n = ∑ k = 0 n ( p + 1 k ) ( − 1 ) k a n − k {\displaystyle b_{n}=\sum _{k=0}^{n}{\binom {p+1}{k}}(-1)^{k}a_{n-k}}
2	a n = ∑ k ≥ 0 ( p + k k ) b n − q k {\displaystyle a_{n}=\sum _{k\geq 0}{\binom {p+k}{k}}b_{n-qk}}	b n = ∑ k ( p + 1 k ) ( − 1 ) k a n − q k {\displaystyle b_{n}=\sum _{k}{\binom {p+1}{k}}(-1)^{k}a_{n-qk}}
3	a n = ∑ k = 0 n f k ( p ) b n − k {\displaystyle a_{n}=\sum _{k=0}^{n}f_{k}^{(p)}b_{n-k}}	b n = ∑ k = 0 n f k ( − p ) a n − k {\displaystyle b_{n}=\sum _{k=0}^{n}f_{k}^{(-p)}a_{n-k}}
4	a n = ∑ k = 0 n ( 2 k k ) b n − k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {2k}{k}}b_{n-k}}	∑ k = 0 n ( 2 k k ) a n − k ( 1 − 2 k ) {\displaystyle \sum _{k=0}^{n}{\binom {2k}{k}}{\frac {a_{n-k}}{(1-2k)}}}
5	a n = ∑ k = 0 n ( 2 k k ) b n − k ( k + 1 ) {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {2k}{k}}{\frac {b_{n-k}}{(k+1)}}}	b n = a n − ∑ k = 1 n ( 2 k k ) a n − k k {\displaystyle b_{n}=a_{n}-\sum _{k=1}^{n}{\binom {2k}{k}}{\frac {a_{n-k}}{k}}}
6	a n = ∑ k = 0 n ( 2 p + 2 k p + k ) ( p + k k ) ( 2 p p ) − 1 b n − k {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {2p+2k}{p+k}}{\binom {p+k}{k}}{\binom {2p}{p}}^{-1}b_{n-k}}	b n = ∑ k = 0 n ( 2 p + 1 2 k ) ( p + k k ) ( p + k 2 k ) − 1 ( − 1 ) k a n − k {\displaystyle b_{n}=\sum _{k=0}^{n}{\binom {2p+1}{2k}}{\binom {p+k}{k}}{\binom {p+k}{2k}}^{-1}(-1)^{k}a_{n-k}}
7	a n = ∑ k ( 4 k 2 k ) b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {4k}{2k}}b_{n-2k}}	b n = ∑ k ( 4 k 2 k ) ( 8 k + 1 ) a n − 2 k ( 2 k + 1 ) ( k + 1 ) {\displaystyle b_{n}=\sum _{k}{\binom {4k}{2k}}{\frac {(8k+1)a_{n-2k}}{(2k+1)(k+1)}}}
8	a n = ∑ k ( 4 k + 2 2 k + 1 ) b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {4k+2}{2k+1}}b_{n-2k}}	b n = a n 2 − ∑ k ≥ 1 ( 4 k − 2 2 k − 1 ) ( 8 k − 3 ) a n − 2 k 2 k ( 4 k − 3 ) {\displaystyle b_{n}={\frac {a_{n}}{2}}-\sum _{k\geq 1}{\binom {4k-2}{2k-1}}{\frac {(8k-3)a_{n-2k}}{2k(4k-3)}}}
9	a n = ( 4 k 2 k ) b n − 2 k ( 1 − 4 k ) {\displaystyle a_{n}={\binom {4k}{2k}}{\frac {b_{n-2k}}{(1-4k)}}}	b n = ∑ k ( 4 k 2 k ) a n − 2 k ( 2 k + 1 ) {\displaystyle b_{n}=\sum _{k}{\binom {4k}{2k}}{\frac {a_{n-2k}}{(2k+1)}}}

Note that relations 3, 4, 5, and 6 in the table may be transformed according to the substitutions a n − k ⟼ a n − q k {\displaystyle a_{n-k}\longmapsto a_{n-qk}} and b n − k ⟼ b n − q k {\displaystyle b_{n-k}\longmapsto b_{n-qk}} for some fixed non-zero integer q ≥ 1 {\displaystyle q\geq 1} .

Let B n {\displaystyle B_{n}} and E n {\displaystyle E_{n}} denote the Bernoulli numbers and Euler numbers, respectively, and suppose that the sequences, { d 2 n } {\displaystyle \{d_{2n}\}} , { e 2 n } {\displaystyle \{e_{2n}\}} , and { f 2 n } {\displaystyle \{f_{2n}\}} are defined by the following exponential generating functions:^[24]

∑ n ≥ 0 d 2 n z 2 n ( 2 n ) ! = 2 z e z − e − z ∑ n ≥ 0 e 2 n z 2 n ( 2 n ) ! = z 2 e z + e − z − 2 ∑ n ≥ 0 f 2 n z 2 n ( 2 n ) ! = z 3 3 ( e z − e − z − 2 z ) . {\displaystyle {\begin{aligned}\sum _{n\geq 0}{\frac {d_{2n}z^{2n}}{(2n)!}}&={\frac {2z}{e^{z}-e^{-z}}}\\\sum _{n\geq 0}{\frac {e_{2n}z^{2n}}{(2n)!}}&={\frac {z^{2}}{e^{z}+e^{-z}-2}}\\\sum _{n\geq 0}{\frac {f_{2n}z^{2n}}{(2n)!}}&={\frac {z^{3}}{3(e^{z}-e^{-z}-2z)}}.\end{aligned}}}

The next table summarizes several notable cases of inversion relations obtained from exponential generating functions in section 3.4 of Riordan's book.^[25]

Relation	Formula for a n {\displaystyle a_{n}}	Inverse Formula for b n {\displaystyle b_{n}}
1	a n = ∑ k = 0 n ( n k ) b k ( k + 1 ) {\displaystyle a_{n}=\sum _{k=0}^{n}{\binom {n}{k}}{\frac {b_{k}}{(k+1)}}}	b n = ∑ k = 0 n B k a n − k {\displaystyle b_{n}=\sum _{k=0}^{n}B_{k}a_{n-k}}
2	a n = ∑ k ( n + k k ) b n + k ( k + 1 ) {\displaystyle a_{n}=\sum _{k}{\binom {n+k}{k}}{\frac {b_{n+k}}{(k+1)}}}	b n = ∑ k ( n + k k ) B k a n + k {\displaystyle b_{n}=\sum _{k}{\binom {n+k}{k}}B_{k}a_{n+k}}
3	a n = ∑ k ( n 2 k ) b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n}{2k}}b_{n-2k}}	b n = ∑ k ( n 2 k ) E 2 k a n − 2 k {\displaystyle b_{n}=\sum _{k}{\binom {n}{2k}}E_{2k}a_{n-2k}}
4	a n = ∑ k ( n + 2 k 2 k ) b n + 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n+2k}{2k}}b_{n+2k}}	b n = ∑ k ( n + 2 k 2 k ) E 2 k a n + 2 k {\displaystyle b_{n}=\sum _{k}{\binom {n+2k}{2k}}E_{2k}a_{n+2k}}
5	a n = ∑ k ( n 2 k ) b n − 2 k ( 2 k + 1 ) {\displaystyle a_{n}=\sum _{k}{\binom {n}{2k}}{\frac {b_{n-2k}}{(2k+1)}}}	b n = ∑ k ( n 2 k ) d 2 k a n − 2 k {\displaystyle b_{n}=\sum _{k}{\binom {n}{2k}}d_{2k}a_{n-2k}}
6	a n = ∑ k ( n + 1 2 k + 1 ) b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n+1}{2k+1}}b_{n-2k}}	( n + 1 ) ⋅ b n = ∑ k ( n + 1 2 k ) d 2 k a n − 2 k {\displaystyle (n+1)\cdot b_{n}=\sum _{k}{\binom {n+1}{2k}}d_{2k}a_{n-2k}}
7	a n = ∑ k ( n 2 k ) ( 2 k + 2 2 ) − 1 b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n}{2k}}{\binom {2k+2}{2}}^{-1}b_{n-2k}}	b n = ∑ k ( n 2 k ) e 2 k a n − 2 k {\displaystyle b_{n}=\sum _{k}{\binom {n}{2k}}e_{2k}a_{n-2k}}
8	a n = ∑ k ( n + 2 2 k + 2 ) b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n+2}{2k+2}}b_{n-2k}}	( n + 2 2 ) ⋅ b n = ∑ k ( n + 2 2 k ) e 2 k a n − 2 k {\displaystyle {\binom {n+2}{2}}\cdot b_{n}=\sum _{k}{\binom {n+2}{2k}}e_{2k}a_{n-2k}}
9	a n = ∑ k ( n 2 k ) ( 2 k + 3 3 ) − 1 b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n}{2k}}{\binom {2k+3}{3}}^{-1}b_{n-2k}}	b n = ∑ k ( n 2 k ) f 2 k a n − 2 k {\displaystyle b_{n}=\sum _{k}{\binom {n}{2k}}f_{2k}a_{n-2k}}
10	a n = ∑ k ( n + 3 2 k + 3 ) b n − 2 k {\displaystyle a_{n}=\sum _{k}{\binom {n+3}{2k+3}}b_{n-2k}}	( n + 3 3 ) ⋅ b n = ∑ k ( n + 3 2 k ) f 2 k a n − 2 k {\displaystyle {\binom {n+3}{3}}\cdot b_{n}=\sum _{k}{\binom {n+3}{2k}}f_{2k}a_{n-2k}}

The inverse relations used in formulating the binomial transform cited in the previous subsection are generalized to corresponding two-index inverse relations for sequences of two indices, and to multinomial inversion formulas for sequences of j ≥ 3 {\displaystyle j\geq 3} indices involving the binomial coefficients in Riordan.^[26] In particular, we have the form of a two-index inverse relation given by

a m n = ∑ j = 0 m ∑ k = 0 n ( m j ) ( n k ) ( − 1 ) j + k b j k ⟷ b m n = ∑ j = 0 m ∑ k = 0 n ( m j ) ( n k ) ( − 1 ) j + k a j k , {\displaystyle a_{mn}=\sum _{j=0}^{m}\sum _{k=0}^{n}{\binom {m}{j}}{\binom {n}{k}}(-1)^{j+k}b_{jk}\quad \longleftrightarrow \quad b_{mn}=\sum _{j=0}^{m}\sum _{k=0}^{n}{\binom {m}{j}}{\binom {n}{k}}(-1)^{j+k}a_{jk},}

and the more general form of a multinomial pair of inversion formulas given by

a n 1 n 2 ⋯ n j = ∑ k 1 , … , k j ( n 1 k 1 ) ⋯ ( n j k j ) ( − 1 ) k 1 + ⋯ + k j b k 1 k 2 ⋯ k j ⟷ b n 1 n 2 ⋯ n j = ∑ k 1 , … , k j ( n 1 k 1 ) ⋯ ( n j k j ) ( − 1 ) k 1 + ⋯ + k j a k 1 k 2 ⋯ k j . {\displaystyle a_{n_{1}n_{2}\cdots n_{j}}=\sum _{k_{1},\ldots ,k_{j}}{\binom {n_{1}}{k_{1}}}\cdots {\binom {n_{j}}{k_{j}}}(-1)^{k_{1}+\cdots +k_{j}}b_{k_{1}k_{2}\cdots k_{j}}\quad \longleftrightarrow \quad b_{n_{1}n_{2}\cdots n_{j}}=\sum _{k_{1},\ldots ,k_{j}}{\binom {n_{1}}{k_{1}}}\cdots {\binom {n_{j}}{k_{j}}}(-1)^{k_{1}+\cdots +k_{j}}a_{k_{1}k_{2}\cdots k_{j}}.}

• Comtet, L. (1974). Advanced Combinatorics (PDF). D. Reidel Publishing Company. ISBN 9027703809. Archived from the original (PDF) on 2017-06-24. Retrieved 2017-02-10.
• Flajolet and Sedgewick (2010). Analytic Combinatorics. Cambridge University Press. ISBN 978-0-521-89806-5.
• Graham, Knuth and Patashnik (1994). Concrete Mathematics: A Foundation for Computer Science (2nd ed.). Addison-Wesley. ISBN 0201558025.
• Knuth, D. E. (1997). The Art of Computer Programming: Fundamental Algorithms. Vol. 1. Addison-Wesley. ISBN 0-201-89683-4.
• Lando, S. K. (2002). Lectures on Generating Functions. American Mathematical Society. ISBN 0-8218-3481-9.
• Olver, Lozier, Boisvert and Clark (2010). NIST Handbook of Mathematical Functions. Cambridge University Press. ISBN 978-0-521-14063-8.{{cite book}}: CS1 maint: multiple names: authors list (link)
• Riordan, J. (1968). Combinatorial Identities. Wiley and Sons.
• Roman, S. (1984). The Umbral Calculus. Dover Publications. ISBN 0-486-44139-3.
• Schmidt, M. D. (3 Nov 2016). "Zeta Series Generating Function Transformations Related to Generalized Stirling Numbers and Partial Sums of the Hurwitz Zeta Function". arXiv:1611.00957 [math.CO].
• Schmidt, M. D. (30 Oct 2016). "Zeta Series Generating Function Transformations Related to Polylogarithm Functions and the k-Order Harmonic Numbers". arXiv:1610.09666 [math.CO].
• Schmidt, M. D. (2017). "Jacobi-Type Continued Fractions for the Ordinary Generating Functions of Generalized Factorial Functions". Journal of Integer Sequences. 20. arXiv:1610.09691.
• Schmidt, M. D. (9 Sep 2016). "Square Series Generating Function Transformations". arXiv:1609.02803 [math.NT].
• Stanley, R. P. (1999). Enumerative Combinatorics. Vol. 2. Cambridge University Press. ISBN 978-0-521-78987-5.

• Why don't they teach Newton's calculus of 'What comes next?' - Mathologer