\documentclass[12pt,reqno]{article} \usepackage[usenames]{color} \usepackage{amssymb} \usepackage{graphicx} \usepackage{amscd} \usepackage[colorlinks=true, linkcolor=webgreen, filecolor=webbrown, citecolor=webgreen]{hyperref} \definecolor{webgreen}{rgb}{0,.5,0} \definecolor{webbrown}{rgb}{.6,0,0} \usepackage{color} \usepackage{fullpage} \usepackage{float} \usepackage{psfig} \usepackage{graphics,amsmath,amssymb} \usepackage{amsthm} \usepackage{amsfonts} \usepackage{latexsym} \usepackage{epsf} \setlength{\textwidth}{6.5in} \setlength{\oddsidemargin}{.1in} \setlength{\evensidemargin}{.1in} \setlength{\topmargin}{-.5in} \setlength{\textheight}{8.9in} \newcommand{\seqnum}[1]{\href{http://www.research.att.com/cgi-bin/access.cgi/as/~njas/sequences/eisA.cgi?Anum=#1}{\underline{#1}}} \begin{document} \begin{center} \epsfxsize=4in \leavevmode\epsffile{logo129.eps} \end{center} \begin{center} \vskip 1cm{\LARGE\bf Exponential Riordan Arrays and \\ \vskip .1in Permutation Enumeration } \vskip 1cm \large Paul Barry\\ School of Science\\ Waterford Institute of Technology\\ Ireland\\ \href{mailto:pbarry@wit.ie}{\tt pbarry@wit.ie} \\ \end{center} \vskip .2 in \begin{abstract} We show that the generating function of the symmetric group with respect to five particular statistics gives rise to an exponential Riordan array, whose inverse is the coefficient array of the associated orthogonal polynomials. This also provides us with an LDU factorization of the Hankel matrix of the associated moments. \end{abstract} \theoremstyle{plain} \newtheorem{theorem}{Theorem} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{example}[theorem]{Example} \newtheorem{conjecture}[theorem]{Conjecture} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \section{Introduction} In this note, we shall re-interpret some of the results of Zeng \cite{Zeng} in terms of exponential Riordan arrays. For this, we let $\mathfrak{S}_n$ denote the set of permutations of $\{1,2,\ldots,n\}$. Given a permutation $\sigma\in \mathfrak{S}_n $, each value $x=\sigma(i),\,1 \leq i \leq n$, can be classified according to one of the five following cases: \begin{enumerate} \item a peak (``pic de cycle''), if $\sigma^{-1}(x)\sigma(x)$; \item a valley (``creux de cycle''), if $\sigma^{-1}>x<\sigma(x)$; \item a double rise (``double mont\'ee de cycle''), if $\sigma^{-1}(x)x>\sigma(x)$; \item a fixed point (``point fixe''), if $\sigma(i)=i$. \end{enumerate} Using the notation of Zeng \cite{Zeng}, we denote the number of peaks, valleys, double rises, double descents, and fixed points of $\sigma$ respectively by pic $\sigma$, cc $\sigma$, dm $\sigma$, dd $\sigma$, and fix $\sigma$. We shall also denote by cyc $\sigma$ the number of cycles of $\sigma$. We set $$\mu_n=\sum_{\sigma \in \mathbf{S}_n} u_1^{\text{cc}\, \sigma}u_2^{\text{pic}\, \sigma}u_3^{\text{dm}\, \sigma}u_4^{\text{dd} \,\sigma}\alpha^{\text{fix}\, \sigma}\beta^{\text{cyc}\, \sigma}.$$ We then have the following theorem. \begin{theorem}\label{Thm} We let $\alpha_1$ and $\alpha_2$ be such that $\alpha_1 \alpha_2=u_1 u_2$ and $\alpha_1+\alpha_2=u_3+u_4$. Then the exponential Riordan array $$\mathbf{L}=\left[e^{\alpha \beta x}\left(\frac{\alpha_1-\alpha_2}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right)^{\beta}, \frac{e^{\alpha_1 x}-e^{\alpha_2 x}}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right]$$ is the inverse of the coefficient array for the family of orthogonal polynomials for which $\mu_n$ are the moments. The elements of the first column of $\mathbf{L}$ are given by $\mu_n$. The Hankel matrix $\mathbf{H}=(\mu_{i+j})_{i,j \ge 0}$ has LDU factorization $$\mathbf{H}=\mathbf{L}\mathbf{D}\mathbf{L}^t.$$ \end{theorem} While partly expository in nature, this note assumes a certain familiarity with integer sequences, generating functions, orthogonal polynomials \cite{Chihara, wgautschi, Szego}, Riordan arrays \cite{SGWW, Spru}, production matrices \cite{ProdMat, P_W}, and the integer Hankel transform \cite{BRP, CRI, Layman}. Many interesting examples of sequences and Riordan arrays can be found in Neil Sloane's On-Line Encyclopedia of Integer Sequences (OEIS), \cite{SL1, SL2}. Sequences are frequently referred to by their OEIS number. For instance, the binomial matrix $\mathbf{B}$ (``Pascal's triangle'') is \seqnum{A007318}. \newline\newline \noindent The plan of the paper is as follows: \begin{enumerate} \item This Introduction \item Integer sequences, exponential Riordan arrays and orthogonal polynomials \item Proof of the theorem \item A matrix product \end{enumerate} \section{Integer sequences, exponential Riordan arrays and orthogonal polynomials} For an integer sequence $a_n$, that is, an element of $\mathbb{Z}^\mathbb{N}$, the power series $f_o(x)=\sum_{k=0}^{\infty}a_k x^k$ is called the \emph{ordinary generating function} or g.f. of the sequence, while $f_e(x)=\sum_{k=0}^{\infty}\frac{a_k}{k!} x^k$ is called the \emph{exponential generating function} or e.g.f. of the sequence. $a_n$ is thus the coefficient of $x^n$ in $f_o(x)$. We denote this by $a_n=[x^n]f_o(x)$. Similarly, $a_n=n![x^n]f_e(x)$. For instance, $F_n=[x^n]\frac{x}{1-x-x^2}$ is the $n$-th Fibonacci number \seqnum{A000045}, while $n!=n![x^n]\frac{1}{1-x}$, which says that $\frac{1}{1-x}$ is the e.g.f. of $n!$ \seqnum{A000142}. For a power series $f(x)=\sum_{n=0}^{\infty}a_n x^n$ with $f(0)=0$ and $f'(0)\neq 0$ we define the reversion or compositional inverse of $f$ to be the power series $\bar{f}(x)=f^{[-1]}(x)$ such that $f(\bar{f}(x))=x$. We sometimes write $\bar{f}= \text{Rev}f$. The \emph{exponential Riordan group} \cite {PasTri,ProdMat,DeutschShap}, is a set of infinite lower-triangular integer matrices, where each matrix is defined by a pair of generating functions $g(x)=g_0+g_1x+g_2x^2+\cdots$ and $f(x)=f_1x+f_2x^2+\cdots$ where $g_0 \ne 0$ and $f_1\ne 0$. The associated matrix is the matrix whose $i$-th column has exponential generating function $g(x)f(x)^i/i!$ (the first column being indexed by 0). The matrix corresponding to the pair $f, g$ is denoted by $[g, f]$. It is \emph{monic} if $g_0=1$. The group law is given by \begin{displaymath} [g, f]*[h, l]=[g(h\circ f), l\circ f].\end{displaymath} The identity for this law is $I=[1,x]$ and the inverse of $[g, f]$ is $[g, f]^{-1}=[1/(g\circ \bar{f}), \bar{f}]$ where $\bar{f}$ is the compositional inverse of $f$. We use the notation $\mathit{e}\mathcal{R}$ to denote this group. If $\mathbf{M}$ is the matrix $[g,f]$, and $\mathbf{u}=(u_n)_{n \ge 0}$ is an integer sequence with exponential generating function $\mathcal{U}$ $(x)$, then the sequence $\mathbf{M}\mathbf{u}$ has exponential generating function $g(x)\mathcal{U}(f(x))$. Thus the row sums of the array $[g,f]$ are given by $g(x)e^{f(x)}$ since the sequence $1,1,1,\ldots$ has exponential generating function $e^x$. \begin{example} The \emph{binomial matrix} is the matrix with general term $\binom{n}{k}$. It is realized by Pascal's triangle. As an exponential Riordan array, it is given by $[e^x,x]$. We further have $$([e^x,x])^m=[e^{mx},x].$$ \end{example} \noindent As an example of the calculation of an inverse, we have the following proposition. \begin{proposition} $$\mathbf{L}^{-1}=\left[\left(\frac{1+\alpha_2 x}{1+\alpha_1 x}\right)^{\frac{\alpha \beta}{\alpha_1-\alpha_2}}\left(\frac{(1+\alpha_2x)^{\frac{\alpha_1}{\alpha_1-\alpha_2}}}{(1+\alpha_1 x)^{\frac{\alpha_2}{\alpha_1-\alpha_2}}}\right)^{-\beta}, \frac{1}{\alpha_2-\alpha_1}\ln\left(\frac{1+\alpha_2x}{1+\alpha_1 x}\right)\right].$$ \end{proposition} \begin{proof} This follows since with $$f(x)=\frac{e^{\alpha_1 x}-e^{\alpha_2 x}}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}$$ we have $$\bar{f}(x)=\frac{1}{\alpha_2-\alpha_1}\ln\left(\frac{1+\alpha_2x}{1+\alpha_1 x}\right).$$ \end{proof} \noindent We note that we can then write $\mathbf{L}^{-1}$ as $$\mathbf{L}^{-1}=\left[\frac{(1+\alpha_2x)^{\frac{\beta(\alpha-\alpha_1)}{\alpha_1-\alpha_2}}}{(1+\alpha_1x)^{\frac{\beta(\alpha-\alpha_2)}{\alpha_1-\alpha_2}}}, \frac{1}{\alpha_2-\alpha_1}\ln\left(\frac{1+\alpha_2x}{1+\alpha_1 x}\right)\right].$$ An important concept for the sequel is that of production matrix. The concept of a \emph{production matrix} \cite{ProdMat_0, ProdMat} is a general one, but for this work we find it convenient to review it in the context of Riordan arrays. Thus let $P$ be an infinite matrix (most often it will have integer entries). Letting $\mathbf{r}_0$ be the row vector $$\mathbf{r}_0=(1,0,0,0,\ldots),$$ we define $\mathbf{r}_i=\mathbf{r}_{i-1}P$, $i \ge 1$. Stacking these rows leads to another infinite matrix which we denote by $A_P$. Then $P$ is said to be the \emph{production matrix} for $A_P$. \noindent If we let $$u^T=(1,0,0,0,\ldots,0,\ldots)$$ then we have $$A_P=\left(\begin{array}{c} u^T\\u^TP\\u^TP^2\\\vdots\end{array}\right)$$ and $$DA_P=A_PP$$ where $D=(\delta_{i+1,j})_{i,j \ge 0}$ (where $\delta$ is the usual Kronecker symbol). In \cite{P_W, Shapiro_bij} $P$ is called the Stieltjes matrix associated to $A_P$. In \cite{ProdMat}, we find the following result concerning matrices that are production matrices for exponential Riordan arrays. \begin{proposition}\label{Deutsch_Shapiro} Let $A=\left(a_{n,k}\right)_{n,k \ge 0}=[g(x),f(x)]$ be an exponential Riordan array and let \begin{equation}\label{seq_def} c(y)=c_0 + c_1 y +c_2 y^2 + \cdots, \qquad r(y)=r_0 + r_1 y + r_2 y^2 + \cdots\end{equation} be two formal power series such that \begin{eqnarray}\label{r_def} r(f(x))&=&f'(x) \\ \label{c_def} c(f(x))&=&\frac{g'(x)}{g(x)}. \end{eqnarray} Then \begin{eqnarray} (i)\qquad a_{n+1,0}&=&\sum_{i} i! c_i a_{n,i} \\ (ii)\qquad a_{n+1,k}&=& r_0 a_{n,k-1}+\frac{1}{k!} \sum_{i\ge k}i!(c_{i-k}+k r_{i-k+1})a_{n,i} \end{eqnarray} or, defining $c_{-1}=0$, \begin{equation}\label{array_def} a_{n+1,k}=\frac{1}{k!}\sum_{i\ge k-1} i!(c_{i-k}+k r_{i-k+1})a_{n,i}.\end{equation} Conversely, starting from the sequences defined by (\ref{seq_def}), the infinite array $\left(a_{n,k}\right)_{n,k\ge 0}$ defined by (\ref{array_def}) is an exponential Riordan array. \end{proposition} \noindent A consequence of this proposition is that $P=\left(p_{i,j}\right)_{i,j\ge 0}$ where $$p_{i,j}=\frac{i!}{j!}(c_{i-j}+jr_{r-j+1}) \qquad (c_{-1}=0).$$ Furthermore, the bivariate exponential generating function $$\phi_P(t,z)=\sum_{n,k} p_{n,k}t^k \frac{z^n}{n!}$$ of the matrix $P$ is given by $$\phi_P(t,z) = e^{tz}(c(z)+t r(z)).$$ Note in particular that we have $$r(x)=f'(\bar{f}(x))$$ and $$c(x)=\frac{g'(\bar{f}(x))}{g(\bar{f}(x))}.$$ \begin{example} We consider the exponential Riordan array $L=[\frac{1}{1-x},x]$, \seqnum{A094587}. This array has elements \begin{displaymath}L=\left(\begin{array}{ccccccc} 1 & 0 & 0 & 0 & 0 & 0 & \cdots \\1 & 1 & 0 & 0 & 0 & 0 & \cdots \\ 2 & 2 & 1 & 0 & 0 & 0 & \cdots \\ 6 & 6 & 3 & 1 & 0 & 0 & \cdots \\ 24 & 24 & 12 & 4 & 1 & 0 & \cdots \\120 & 120 & 60 & 20 & 5 & 1 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right)\end{displaymath} and general term $[k \le n] \frac{n!}{k!}$ with inverse \begin{displaymath}L^{-1}=\left(\begin{array}{ccccccc} 1 & 0 & 0 & 0 & 0 & 0 & \cdots \\-1 & 1 & 0 & 0 & 0 & 0 & \cdots \\ 0 & -2 & 1 & 0 & 0 & 0 & \cdots \\ 0 & 0 & -3 & 1 & 0 & 0 & \cdots \\ 0 & 0 & 0& -4 & 1 & 0 & \cdots \\0 & 0 & 0 & 0 & -5 & 1 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right)\end{displaymath} which is the array $[1-x,x]$. In particular, we note that the row sums of the inverse, which begin $1,0,-1,-2,-3,\ldots$ (that is, $1-n$), have e.g.f. $(1-x)\exp(x)$. This sequence is thus the binomial transform of the sequence with e.g.f. $(1-x)$ (which is the sequence starting $1,-1,0,0,0,\ldots$). In order to calculate the production matrix $\mathbf{P}$ of $L=[\frac{1}{1-x},x]$ we note that $f(x)=x$, and hence we have $f'(x)=1$ so $f'(\bar{f}(x))=1$. Also $g(x)=\frac{1}{1-x}$ leads to $g'(x)=\frac{1}{(1-x)^2}$, and so, since $\bar{f}({x})=x$, we get $$\frac{g'(\bar{f}(x))}{g(\bar{f}(x))}=\frac{1}{1-x}.$$ Thus the generating function for $\mathbf{P}$ is $$e^{tz}\left(\frac{1}{1-z}+t\right).$$ Thus $\mathbf{P}$ is the matrix $[\frac{1}{1-x},x]$ with its first row removed. \end{example} \begin{example} We consider the exponential Riordan array $L=[1, \frac{x}{1-x}]$. The general term of this matrix may be calculated as follows: \begin{eqnarray*}T_{n,k}&=&\frac{n!}{k!}[x^n]\frac{x^k}{(1-x)^k}\\ &=&\frac{n!}{k!}[x^{n-k}](1-x)^{-k}\\ &=&\frac{n!}{k!}[x^{n-k}]\sum_{j=0}^{\infty}\binom{-k}{j}(-1)^jx^j\\ &=&\frac{n!}{k!}[x^{n-k}]\sum_{j=0}^{\infty}\binom{k+j-1}{j}x^j\\ &=&\frac{n!}{k!}\binom{k+n-k-1}{n-k}\\ &=&\frac{n!}{k!}\binom{n-1}{n-k},\end{eqnarray*} with \begin{displaymath}L=\left(\begin{array}{ccccccc} 1 & 0 & 0 & 0 & 0 & 0 & \cdots \\0 & 1 & 0 & 0 & 0 & 0 & \cdots \\ 0 & 2 & 1 & 0 & 0 & 0 & \cdots \\0 & 6 & 6 & 1 & 0 & 0 & \cdots \\ 0 & 24 & 36 & 12 & 1 & 0 & \cdots \\0 & 120 & 240 & 120 & 20 & 1 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right).\end{displaymath} Thus its row sums, which have e.g.f. $\exp \left(\frac{x}{1-x}\right)$, have general term $\sum_{k=0}^n \frac{n!}{k!}\binom{n-1}{n-k}$. This is \seqnum{A000262}, the `number of ``sets of lists": the number of partitions of $\{1,..,n\}$ into any number of lists, where a list means an ordered subset'. Its general term is equal to $(n-1)!L_{n-1}(1,-1)$. The inverse of $\left[1, \frac{x}{1-x}\right]$ is the exponential Riordan array $L^{-1}=\left[1,\frac{x}{1+x}\right]$, \seqnum{A111596}. The row sums of this sequence have e.g.f. $\exp\left(\frac{x}{1+x}\right)$, and start $1, 1, -1, 1, 1, -19, 151, \ldots$. This is \seqnum{A111884}. To calculate the production matrix of $L=\left[1,\frac{x}{1-x}\right]$ we note that $g'(x)=0$, while $\bar{f}(x)=\frac{x}{1+x}$ with $f'(x)=\frac{1}{(1+x)^2}$. Thus $$f'(\bar{f}(x))=(1+x)^2,$$ and so the generating function of the production matrix is given by $$ e^{tz}t(1+z)^2.$$ \noindent Thus the production matrix of the inverse begins \begin{displaymath}\left(\begin{array}{ccccccc} 0 & 1 & 0 & 0 & 0 & 0 & \cdots \\0 & 2 & 1 & 0 & 0 & 0 & \cdots \\ 0 & 2 & 4 & 1 & 0 & 0 & \cdots \\ 0 & 0 & 6 & 6 & 1 & 0 & \cdots \\0 & 0 & 0 & 12 & 8 & 1 & \cdots \\0 & 0 & 0 & 0 & 20 & 10 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right).\end{displaymath} \end{example} \begin{example} The exponential Riordan array $A= \left[\frac{1}{1-x},\frac{x}{1-x}\right]$, or \begin{displaymath}A=\left(\begin{array}{ccccccc} 1 & 0 & 0 & 0 & 0 & 0 & \cdots \\1 & 1 & 0 & 0 & 0 & 0 & \cdots \\ 2 & 4 & 1 & 0 & 0 & 0 & \cdots \\ 6 & 18 & 9 & 1 & 0 & 0 & \cdots \\ 24 & 96 & 72 & 16 & 1 & 0 & \cdots \\120 & 600 & 600 & 200 & 25 & 1 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right)\end{displaymath} has general term $$ T_{n,k}=\frac{n!}{k!}\binom{n}{k}.$$ Its inverse is $A^{-1}=\left[\frac{1}{1+x},\frac{x}{1+x}\right]$ with general term $(-1)^{n-k}\frac{n!}{k!}\binom{n}{k}$. This is \seqnum{A021009}, the triangle of coefficients of the Laguerre polynomials $L_n(x)$. The production matrix of A is given by \begin{displaymath}\left(\begin{array}{ccccccc} 1 & 1 & 0 & 0 & 0 & 0 & \cdots \\1 & 3 & 1 & 0 & 0 & 0 & \cdots \\ 0 & 4 & 5 & 1 & 0 & 0 & \cdots \\ 0 & 0 & 9 & 7 & 1 & 0 & \cdots \\0 & 0 & 0 & 16 & 9 & 1 & \cdots \\0 & 0 & 0 & 0 & 25 & 11 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right).\end{displaymath} \end{example} \begin{example} The exponential Riordan array $L=\left[e^x,\ln\left(\frac{1}{1-x}\right)\right]$, or \begin{displaymath}L=\left(\begin{array}{ccccccc} 1 & 0 & 0 & 0 & 0 & 0 & \cdots \\1 & 1 & 0 & 0 & 0 & 0 & \cdots \\ 1 & 3 & 1 & 0 & 0 & 0 & \cdots \\ 1 & 8 & 6 & 1 & 0 & 0 & \cdots \\ 1 & 24 & 29 & 10 & 1 & 0 & \cdots \\1 & 89 & 145 & 75 & 15 & 1 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right)\end{displaymath} is the coefficient array for the polynomials $$_2F_0(-n,x;-1)$$ which are an unsigned version of the Charlier polynomials (of order $0$) \cite{wgautschi, Roman, Szego}. This is \seqnum{A094816}. We have $$L=[e^x,x]* \left[ 1, \ln\left(\frac{1}{1-x}\right)\right],$$ or the product of the binomial array $\mathbf{B}$ and the array of (unsigned) Stirling numbers of the first kind. The production matrix of the inverse of this matrix is given by \begin{displaymath}\left(\begin{array}{ccccccc} -1 & 1 & 0 & 0 & 0 & 0 & \cdots \\1 & -2 & 1 & 0 & 0 & 0 & \cdots \\ 0 & 2 & -3 & 1 & 0 & 0 & \cdots \\ 0 & 0 & 3 & -4 & 1 & 0 & \cdots \\0 & 0 & 0 & 4 & -5 & 1 & \cdots \\0 & 0 & 0 & 0 & 5 & -6 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right)\end{displaymath} which indicates the orthogonal nature of these polynomials. We can prove this form as follows. We have $$\left[e^x, \ln\left(\frac{1}{1-x}\right)\right]^{-1}=\left[e^{-(1-e^{-x})},1-e^{-x}\right].$$ Hence $g(x)=e^{-(1-e^{-x})}$ and $f(x)=1-e^{-x}$. We are thus led to the equations \begin{eqnarray*} r(1-e^{-x})&=&\,e^{-x},\\ c(1-e^{-x})&=&-e^{-x},\end{eqnarray*} with solutions $r(x)=1-x$, $c(x)=x-1$. Thus the bi-variate generating function for the production matrix of the inverse array is $$e^{tz}(z-1+t(1-z)),$$ which is what is required. \end{example} According to Proposition \textbf{\ref{Deutsch_Shapiro}}, for a Riordan array to have a tri-diagonal production array $P$, it is necessary and sufficient that $P$ be of the form \begin{displaymath}\left(\begin{array}{ccccccc} c_0 & r_0 & 0 & 0 & 0 & 0 & \cdots \\c_1 & c_0+r_1 & r_0 & 0 & 0 & 0 & \cdots \\ 0 & 2(c_1+r_2) & c_0+2r_1 & r_0 & 0 & 0 & \cdots \\ 0 & 0 & 3(c_1+2r_2) & r_0 & 1 & 0 & \cdots \\0 & 0 & 0 & 4(c_1+3r_2) & c_0+4r_1 & r_0 & \cdots \\0 & 0 & 0 & 0 & 5(c_1+4r_2) & c_0+5r_1 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right).\end{displaymath} We recognize in this the form of Meixner's solution \cite{Meixner, Godsil} to the question of which families of Sheffer polynomials \cite{He_Sheffer} are orthogonal. Thus $P$ corresponds to the family of orthogonal polynomials $(S_n(x))_{n\ge 0}$ that satisfy $$S_{n+1}(x)=(x-(c_0+n r_1))S_n(x)-n(c_1+n r_2)S_{n-1}(x).$$ Of importance to this study are the following results (the first is the well-known ``Favard's Theorem''), which we essentially reproduce from \cite{Kratt}. \begin{theorem} \cite{Kratt} {\rm (Cf.\ \cite[Th\'eor\`eme $9$, p.\ I-4]{Viennot} or \cite[Theorem 50.1]{Wall}).} Let $(p_n(x))_{n\ge 0}$ be a sequence of monic polynomials, the polynomial $p_n(x)$ having degree $n=0,1,\ldots$. Then the sequence $(p_n(x))$ is (formally) orthogonal if and only if there exist sequences $(\alpha_n)_{n\ge 0}$ and $(\beta_n)_{n\ge 1}$ with $\beta_n \neq 0$ for all $n\ge 1$, such that the three-term recurrence $$p_{n+1}=(x-\alpha_n)p_n(x)-\beta_n (x), \quad \text{for}\quad n\ge 1, $$ holds, with initial conditions $p_0(x)=1$ and $p_1(x)=x-\alpha_0$. \end{theorem} \begin{theorem} \cite{Kratt} {\rm (Cf.\ \cite[Prop.\ 1, (7), p. V-5]{Viennot} or \cite[Theorem 51.1]{Wall}).} Let $(p_n(x))_{n\ge 0}$ be a sequence of monic polynomials, which is orthogonal with respect to some functional $L$. Let $$p_{n+1}=(x-\alpha_n)p_n(x)-\beta_n (x), \quad \text{for}\quad n\ge 1, $$ be the corresponding three-term recurrence which is guaranteed by Favard's theorem. Then the generating function $$g(x)=\sum_{k=0}^{\infty} \mu_k x^k $$ for the moments $\mu_k=L(x^k)$ satisfies $$g(x)=\cfrac{\mu_0}{1-\alpha_0 x- \cfrac{\beta_1 x^2}{1-\alpha_1 x - \cfrac{\beta_2 x^2}{1-\alpha_2 x - \cfrac{\beta_3 x^2}{1-\alpha_3 x -\cdots}}}}.$$ \end{theorem} The Hankel transform of $\mu_n$, which is the sequence with general term $h_n=|\mu_{i+j}|_{0\le i,j\le n}$, is then given by $$h_n=\mu_0^{n+1}\beta_1^n\beta_2^{n-1}\cdots\beta_{n-1}^2\beta_n.$$ \section{Proof of Theorem \ref{Thm}} \begin{proof} We first note that since $$g(x)=e^{\alpha \beta x}\left(\frac{\alpha_1-\alpha_2}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right)^{\beta},$$ by \cite[Theorem 1]{Zeng}, the first column of the Riordan array is indeed $\{\mu_n\}_{n\ge 0}$. We now calculate the production matrix $\mathbf{P}_{\mathbf{L}}$ of $\mathbf{L}$. We have $$r(x)=f'(\bar{f}(x))=(1+\alpha_2x)(1+\alpha_1x)$$ and $$c(x)=\frac{g'(\bar{f}(x))}{g(\bar{f}(x))}=\beta(\alpha+\alpha_1 \alpha_2 x).$$ Thus the bivariate generating function for the production matrix $\mathbf{P}_{\mathbf{L}}$ of $\mathbf{L}$ is given by $$e^{tz}(\beta(\alpha+\alpha_1 \alpha_2 x)+t(1+\alpha_2x)(1+\alpha_1x)).$$ Now this is equal to $$e^{tz}(\alpha \beta +\beta u_1 u_2 x+t(1+(u_3+u_4)x+u_1u_2x^2)).$$ But this implies that $\mathbf{P}_{\mathbf{L}}$ is precisely the Jacobi tri-diagonal matrix corresponding to the continued $J$-fraction $$\cfrac{1}{1-\alpha \beta x - \cfrac{\beta u_1u_2x^2}{1-(\alpha \beta +u_3+u_4)x- \cfrac{2(\beta+1)u_1 u_2x^2}{1-(\alpha \beta +2(u_3+u_4))x- \cfrac{3(\beta+2)u_1u_2x^2}{1-\cdots}}}}$$ which by \cite{Zeng} is equal to the generating function $$\sum_{k=0}^{\infty}\mu_k x^k.$$ The matrix $\mathbf{P}_{\mathbf{L}}$ begins: \begin{displaymath}\left(\begin{array}{ccccccc} \alpha \beta & 1 & 0 & 0 & 0 & 0 & \cdots \\\beta u_1 u_2 & \alpha \beta+u_3+u_4 & 0 & 0 & 0 & 0 & \cdots \\0 & 2(\beta+1)u_1u_2 & \alpha \beta+2(u_3+u_4) & 0 & 0 & 0 & \cdots \\ 0 & 0 & 3(\beta+2)u_1u_2 & \alpha \beta+3(u_3+u_4) & 0 & 0 & \cdots \\ 0 & 0 & 0 & 4(\beta+3)u_1u_2 & \alpha \beta+4(u_3+u_4) & 0 & \cdots \\0 & 0 & 0 & 0 &5(\beta+4)u_1u_2 & \alpha \beta+5(u_3+u_4) &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right)\end{displaymath} This implies that $\mathbf{L}^{-1}$ is indeed the coefficient array of the set of orthogonal polynomials which correspond to the tri-diagonal array $\mathbf{P}_{\mathbf{L}}$. The results of \cite{Triple, P_W} now imply that if $\mathbf{H}=(\mu_{i+j})_{i,j\ge 0}$ then $$\mathbf{H}=\mathbf{L}\mathbf{D}\mathbf{L}^t.$$ \end{proof} As pointed out by an anonymous referee, this result could also have been arrived at using the theory of orthogonal Sheffer polynomials, as the $\mu_n$ are seen to be the moment sequence of the orthogonal polynomials defined by $$P_{n+1}(x)=(x-b_n)P_n(x)-\lambda_nP_{n-1}(x),$$ with $P_{-1}(x)=0$ and $P_1(x)=1$, where $b_n=\alpha \beta +n(u_3+u_4)$ and $\lambda_n=n(\beta+n)u_1 u_2$. Thus $(P_n(x))_{n\ge0}$ is a sequence of orthogonal Sheffer polynomials \cite{Godsil}. Note that the interrelationship between Riordan arrays and Sheffer polynomials is comprehensively studied in \cite{He_Sheffer}. The elements of the diagonal matrix $\mathbf{D}$ are the successive products of the elements of the sub-diagonal of $\mathbf{P}_{\mathbf{L}}$: $$ \beta u_1 u_2, \quad 2\beta(\beta+1)u_1^2 u_2^2,\quad 6\beta(\beta+1)(\beta+2)u_1^3 u_2^3,\ldots$$ \begin{corollary} The Hankel transform of $\mu_n$ is given by $$h_n=(u_1 u_2)^{\binom{n+1}{2}}\prod_{k=0}^n k!(\beta+k)^{n-k}.$$ \end{corollary} We notice in particular that this is independent of $\alpha$, $u_3$ and $u_4$. \noindent We have the following factorization. \begin{eqnarray*} \mathbf{L}&=&\left[e^{\alpha \beta x}\left(\frac{\alpha_1-\alpha_2}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right)^{\beta}, \frac{e^{\alpha_1 x}-e^{\alpha_2 x}}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right]\\ &=&[e^{\alpha \beta x},x]\left[\left(\frac{\alpha_1-\alpha_2}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right)^{\beta}, \frac{e^{\alpha_1 x}-e^{\alpha_2 x}}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right]\\ &=& [e^x,x]^{\alpha \beta} \mathbf{L}_0,\end{eqnarray*} where the matrix $\mathbf{L_0}$ has production matrix generated by $$e^{tz}(\beta u_1 u_2 x+t(1+(u_3+u_4)x+u_1u_2x^2)).$$ This matrix begins \begin{displaymath}\left(\begin{array}{ccccccc} 0 & 1 & 0 & 0 & 0 & 0 & \cdots \\\beta u_1 u_2 & u_3+u_4 & 0 & 0 & 0 & 0 & \cdots \\0 & 2(\beta+1)u_1u_2 & 2(u_3+u_4) & 0 & 0 & 0 & \cdots \\ 0 & 0 & 3(\beta+2)u_1u_2 & 3(u_3+u_4) & 0 & 0 & \cdots \\ 0 & 0 & 0 & 4(\beta+3)u_1u_2 & 4(u_3+u_4) & 0 & \cdots \\0 & 0 & 0 & 0 &5(\beta+4)u_1u_2 & 5(u_3+u_4) &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right).\end{displaymath} Thus $\mathbf{L}_0^{-1}$ is the coefficient array of the orthogonal polynomials whose moments have generating function given by $$\cfrac{1}{1 - \cfrac{\beta u_1u_2x^2}{1-(u_3+u_4)x- \cfrac{2(\beta+1)u_1 u_2x^2}{1-\cdots}}}.$$ In fact, we have $$\mathbf{L}_0^{-1}=\left[\left(\frac{(1+\alpha_2x)^{\frac{\alpha_1}{\alpha_1-\alpha_2}}}{(1+\alpha_1 x)^{\frac{\alpha_2}{\alpha_1-\alpha_2}}}\right)^{-\beta}, \frac{1}{\alpha_2-\alpha_1}\ln\left(\frac{1+\alpha_2x}{1+\alpha_1 x}\right)\right].$$ \begin{example} The exponential Riordan array $\left[\frac{e^x}{2e^x-e^{2x}},\frac{e^{2x}-e^x}{2e^x-e^{2x}}\right]$ begins: \begin{displaymath}\left(\begin{array}{ccccccc} 1 & 0 & 0 & 0 & 0 & 0 & \cdots \\1 & 1 & 0 & 0 & 0 & 0 & \cdots \\ 3 & 5 & 1 & 0 & 0 & 0 & \cdots \\ 13 & 31 & 12 & 1 & 0 & 0 & \cdots \\ 75 & 233 & 133 & 22 & 1 & 0 & \cdots \\541 & 2071 & 1560 & 385 & 35 & 1 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right).\end{displaymath} Its first column is the sequence \seqnum{A000670}, known as the ordered Bell numbers. The production matrix of this array is \begin{displaymath}\left(\begin{array}{ccccccc} 1 & 1 & 0 & 0 & 0 & 0 & \cdots \\2 & 4 & 1 & 0 & 0 & 0 & \cdots \\ 0 & 8 & 7 & 1 & 0 & 0 & \cdots \\ 0 & 0 & 18 & 10 & 1 & 0 & \cdots \\0 & 0 & 0 & 32 & 13 & 1 & \cdots \\0 & 0 & 0 & 0 & 50 & 16 &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right).\end{displaymath} Thus the ordered Bell numbers are the moments $\mu_n$ of the family of orthogonal polynomials whose coefficient array is given by $$\left[\frac{e^x}{2e^x-e^{2x}},\frac{e^{2x}-e^x}{2e^x-e^{2x}}\right]^{-1}=\left[\frac{1}{1+x},\ln\left(\frac{1+2x}{1+x}\right)\right],$$ and whose generating function is given by $$\cfrac{1}{1-x- \cfrac{2x^2}{1-4x- \cfrac{8x^2}{1-7x- \cfrac{18x^2}{1-\cdots}}}}.$$ \end{example} \section{A matrix product} We recall that the matrix $[\frac{1}{1-rx},\frac{x}{1-rx}]$ has production matrix \begin{displaymath}\left(\begin{array}{ccccccc} r & 1 & 0 & 0 & 0 & 0 & \cdots \\r^2 & 3r & 1 & 0 & 0 & 0 & \cdots \\ 0 & 4r^2 & 5r & 1 & 0 & 0 & \cdots \\ 0 & 0 & 9r^2 & 7r & 1 & 0 & \cdots \\0 & 0 & 0 & 16r^2 & 9r & 1 & \cdots \\0 & 0 & 0 & 0 & 25r^2 & 11r &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots\end{array}\right).\end{displaymath} We use the notation $\mathbf{Lag}[r]$ for this matrix $\left[\frac{1}{1-rx},\frac{x}{1-rx}\right]$ \cite{Lah}. We now form the product $\mathbf{L}\cdot\mathbf{Lag}[r]$ to get \begin{eqnarray*} \mathbf{L}\cdot \mathbf{Lag}[r]&=&\left[e^{\alpha \beta x}\left(\frac{\alpha_1-\alpha_2}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right)^{\beta}, \frac{e^{\alpha_1 x}-e^{\alpha_2 x}}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right]\cdot \left[\frac{1}{1-rx},\frac{x}{1-rx}\right]\\ &=&\left[e^{\alpha \beta x}\left(\frac{\alpha_1-\alpha_2}{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}\right)^{\beta}\frac{\alpha_1 e^{\alpha_2 x}-\alpha_2 e^{\alpha_1 x}}{(\alpha_1+r) e^{\alpha_2 x}-(\alpha_2+r) e^{\alpha_1 x}}, \frac{e^{\alpha_1 x}-e^{\alpha_2 x}}{(\alpha_1+r) e^{\alpha_2 x}-(\alpha_2+r) e^{\alpha_1 x}}\right].\end{eqnarray*} For $\beta=1$, this product is equal to $$\left[e^{\alpha x}\frac{\alpha_1-\alpha_2}{(\alpha_1+r) e^{\alpha_2 x}-(\alpha_2+r) e^{\alpha_1 x}}, \frac{e^{\alpha_1 x}-e^{\alpha_2 x}}{(\alpha_1+r) e^{\alpha_2 x}-(\alpha_2+r) e^{\alpha_1 x}}\right].$$ This matrix has a tri-diagonal production array which starts \scriptsize { \begin{displaymath}\left(\begin{array}{ccccccc} \alpha+r & 1 & 0 & 0 & 0 & 0 & \cdots \\(\alpha_1+r)(\alpha_2+r) & \alpha+\alpha_1+\alpha_2+3r & 1 & 0 & 0 & 0 & \cdots \\ 0 & 4(\alpha_1+r)(\alpha_2+r) & \alpha+2(\alpha_1+\alpha_2)+5r & 1 & 0 & 0 & \cdots \\ 0 & 0 & 9(\alpha_1+r)(\alpha_2+r) & \alpha+3(\alpha_1+\alpha_2)+7r & 1 & 0 & \cdots \\ 0 & 0 & 0 & 16(\alpha_1+r)(\alpha_2+r) & \alpha+4(\alpha_1+\alpha_2)+9r & 1 & \cdots \\ 0 & 0 & 0 & 0 & 25(\alpha_1+r)(\alpha_2+r) & \alpha+5(\alpha_1+\alpha_2)+11r &\cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots \end{array}\right).\end{displaymath}} \normalsize Thus for $\beta=1$, this product matrix is again the inverse of the coefficient array of a family of orthogonal polynomials. Taking inverses, we arrive at the following product of orthogonal polynomial coefficient arrays: $$\left[\frac{1}{1+rx},\frac{x}{1+rx}\right]\cdot \left[\left(\frac{1+\alpha_2 x}{1+\alpha_1 x}\right)^{\frac{\alpha }{\alpha_1-\alpha_2}}\frac{(1+\alpha_1x)^{\frac{\alpha_2}{\alpha_1-\alpha_2}}}{(1+\alpha_2 x)^{\frac{\alpha_1}{\alpha_1-\alpha_2}}}, \frac{1}{\alpha_2-\alpha_1}\ln\left(\frac{1+\alpha_2x}{1+\alpha_1 x}\right)\right]$$ $$=\left[\frac{1}{1+rx},\frac{x}{1+rx}\right]\cdot \left[\frac{(1+\alpha_2x)^{\frac{\alpha-\alpha_1}{\alpha_1-\alpha_2}}}{(1+\alpha_1x)^{\frac{\alpha-\alpha_2}{\alpha_1-\alpha_2}}}, \frac{1}{\alpha_2-\alpha_1}\ln\left(\frac{1+\alpha_2x}{1+\alpha_1 x}\right)\right]$$ $$=\left[\frac{(1+(\alpha_1+r)x)^{\frac{\alpha_2-\alpha}{\alpha_1-\alpha_2}}}{(1+(\alpha_2+r)x)^{\frac{\alpha_1-\alpha}{\alpha_1-\alpha_2}}}, \frac{1}{\alpha_1-\alpha_2}\ln\left(\frac{1+(\alpha_1+r)x}{1+(\alpha_2+r)x}\right)\right].$$ \begin{thebibliography}{30} \bibitem{BRP} P. Barry, P. Rajkovi\'c, and M. Petkovi\'c, An application of Sobolev orthogonal polynomials to the computation of a special Hankel determinant, in W. Gautschi, G. Rassias, and M. Themistocles, eds., \emph{Approximation and Computation}, Springer, 2010. \bibitem{PasTri} P. Barry, On a family of generalized Pascal triangles defined by exponential Riordan arrays, \emph{J. Integer Seq.}, {\bf 10} (2007), \href{http://www.cs.uwaterloo.ca/journals/JIS/VOL10/Barry/barry202.html}{Article 07.3.5}. \bibitem{Lah} P. Barry, Some observations on the Lah and Laguerre transforms of integer sequences, \emph{J. Integer Seq.}, {\bf 10} (2007), \href{http://www.cs.uwaterloo.ca/journals/JIS/VOL10/Barry/barry401.html}{Article 07.4.6}. \bibitem{Cheon} G.-S. Cheon, H. Kim, and L. W. Shapiro, Riordan group involution, \emph{Linear Algebra Appl.}, \textbf{428} (2008), 941--952. \bibitem{Chihara} T. S. Chihara, {\it An Introduction to Orthogonal Polynomials}, Gordon and Breach, New York, 1978. \bibitem{CMS} C. Corsani, D. Merlini, and R. Sprugnoli, Left-inversion of combinatorial sums, \emph{Discrete Math.} \textbf{180} (1998), 107--122. \bibitem{CRI} A. Cvetkovi\'c, P. Rajkovi\'c and M. Ivkovi\'c, Catalan numbers, the Hankel transform and Fibonacci numbers, \emph{J. Integer Seq.}, {\bf 5} (2002), \href{http://www.cs.uwaterloo.ca/journals/JIS/VOL5/Ivkovic/ivkovic3.html}{Article 02.1.3}. \bibitem{DeutschShap} E. Deutsch and L. Shapiro, Exponential Riordan arrays, Lecture Notes, Nankai University, 2004, available electronically at \href{http://www.combinatorics.net/ppt2004/Louis%20W.%20Shapiro/shapiro.htm}{\tt http://www.combinatorics.net/ppt2004/Louis\%20W.\%20Shapiro/shapiro.htm}. \bibitem{ProdMat_0} E. Deutsch, L. Ferrari, and S. Rinaldi, Production matrices, \emph{Adv. in Appl. Math.} \textbf{34} (2005), 101--122. \bibitem{ProdMat} E. Deutsch, L. Ferrari, and S. Rinaldi, Production matrices and Riordan arrays, \href{http://arxiv.org/abs/math/0702638v1}{\tt http://arxiv.org/abs/math/0702638v1}, February 22 2007. \bibitem{wgautschi} W. Gautschi, {\it Orthogonal Polynomials: Computation and Approximation}, Clarendon Press - Oxford, 2003. \bibitem{Godsil} C. D. Godsil, \emph{Algebraic Combinatorics}, Chapman and Hall, New York. \bibitem{He} Tian-Xiao He and R. Sprugnoli, Sequence characterization of Riordan arrays, \emph{Discrete Math.} \textbf{2009} (2009), 3962--3974. \bibitem{Kratt} C. Krattenthaler, Advanced determinant calculus, {\it S\'em. Lotharingien Combin.} {\bf 42} (1999), Article B42q, available electronically at \href{http://www.mat.univie.ac.at/~kratt/artikel/detsurv.html}{\tt http://www.mat.univie.ac.at/~kratt/artikel/detsurv.html}. \bibitem{He_Sheffer} Tian-Xiao He, L.~C. Hsu, and P.~J.-S. Shiue, The Sheffer group and the Riordan group, \emph{Discrete Appl. Math.} \textbf{155} (2007), 1895--1909. \bibitem{Layman} J. W. Layman, The Hankel transform and some of its properties, \emph{J. Integer Seq.}, {\bf 4} (2001), \href{http://www.cs.uwaterloo.ca/journals/JIS/VOL4/LAYMAN/hankel.html}{Article 01.1.5}. \bibitem{Triple} P. Peart and L. Woodson, Triple factorization of some Riordan matrices, \emph{Fibonacci Quart.}, \textbf{31} (1993), 121--128. \bibitem{P_W} P. Peart and W.-J. Woan, Generating functions via Hankel and Stieltjes matrices, \emph{J. Integer Seq.}, \textbf{3} (2000), \href{http://www.cs.uwaterloo.ca/journals/JIS/VOL3/PEART/peart1.html}{Article 00.2.1}. \bibitem{Meixner} J. Meixner, Orthogonale Polynomsysteme mit einer Besonderen Gestalt der Erzeugenden Funktion, \emph{J. Lond. Math. Soc.} \textbf{9}, (1934), 6--13. \bibitem{Roman} S. Roman, \emph{The Umbral Calculus}, Dover Publications, 2005. \bibitem{SGWW} L. W. Shapiro, S. Getu, W.-J. Woan and L. C. Woodson, The Riordan group, \emph{Discrete Appl. Math.} \textbf{34} (1991), 229--239. \bibitem{Shapiro_bij} L.~W.~Shapiro, Bijections and the Riordan group, \emph{Theoret. Comput. Sci.} \textbf{307} (2003), 403--413. \bibitem{SL1} N. J. A.~Sloane, \emph{The On-Line Encyclopedia of Integer Sequences}. Published electronically at \texttt{http://www.research.att.com/$\sim$njas/sequences/}, 2010. \bibitem{SL2} N. J. A.~Sloane, The On-Line Encyclopedia of Integer Sequences, \emph{Notices Amer. Math. Soc.}, \textbf{50} (2003), 912--915. \bibitem{Spru} R. Sprugnoli, Riordan arrays and combinatorial sums, \emph{Discrete Math.} \textbf{132} (1994), 267--290. \bibitem{Szego} G. Szeg\"o, \emph{Orthogonal Polynomials}, 4th ed., Amer. Math. Soc., 1975. \bibitem{Viennot} X. J. Viennot, Une th\'eorie combinatoire des polyn\^omes orthogonaux g\'en\'eraux, UQAM, Montreal, Qu\'ebec, 1983. \bibitem{Wall} H.~S. Wall, \emph{Analytic Theory of Continued Fractions}, Chelsea, 1973. \bibitem{Woan} W.-J. Woan, Hankel matrices and lattice paths, \emph{J. Integer Seq.}, \textbf{4} (2001), \href{http://www.cs.uwaterloo.ca/journals/JIS/VOL4/WOAN/hankel2.html}{Article 01.1.2}. \bibitem{Zeng} J. Zeng, \'Enum\'erations de permutations et J-fractions continues, \emph{Europ. J. Combin.}, \textbf{14} (1993), 373--382. \end{thebibliography} \bigskip \hrule \bigskip \noindent 2010 {\it Mathematics Subject Classification}: Primary 05A15; Secondary 42C05, 11B83, 11C20, 15B05, 15B36, 20B30, 33C45. \noindent \emph{Keywords: } Permutation, integer sequence, orthogonal polynomials, moments, exponential Riordan array, Hankel determinant, Hankel transform. \bigskip \hrule \bigskip \noindent (Concerned with sequences \seqnum{A000045}, \seqnum{A000142}, \seqnum{A000262}, \seqnum{A000670}, \seqnum{A007318}, \seqnum{A021009}, \seqnum{A094587}, \seqnum{A094816}, \seqnum{A111596}, and \seqnum{A111884}.) \bigskip \hrule \bigskip \vspace*{+.1in} \noindent Received June 25 2010; revised version received September 13 2010 Published in {\it Journal of Integer Sequences}, December 5 2010. \bigskip \hrule \bigskip \noindent Return to \htmladdnormallink{Journal of Integer Sequences home page}{http://www.cs.uwaterloo.ca/journals/JIS/}. \vskip .1in \end{document}