<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">\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}{-.1in}
\setlength{\textheight}{8.4in}

\newcommand{\seqnum}[1]{\href{https://oeis.org/#1}{\underline{#1}}}

\usepackage{amscd,MnSymbol}
\usepackage{tikz}
\usepackage[all,color]{xy}
\usepackage{fancybox}
\usepackage{arydshln}

\def\Cl{{\mathcal{C}  \kern -0.1em \ell}_{0,n}}
\def\R{\mathbb{R}}
\def\N{\mathbb{N}}
\def\A{\mathcal{A}}
\def\P{{\cal P}}
\def\Pk{\P_k}
\def\Pkn{\Pk^n}
\def\xv{\underline{x}}

\begin{document}

\begin{center}
\epsfxsize=4in
\leavevmode\epsffile{logo129.eps}
\end{center}

\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}
\newtheorem{property}[theorem]{Property}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}

\begin{center}
\vskip 1cm{\LARGE\bf
Combinatorial Identities Associated with a\\
\vskip .11in 
Multidimensional Polynomial Sequence}
\vskip 1cm
Isabel Ca\c{c}\~ao and Helmuth R. Malonek \\
CIDMA and Department of Mathematics\\
University of Aveiro \\
3810-193 Aveiro \\
Portugal \\
\href{mailto:isabel.cacao@ua.pt}{\tt isabel.cacao@ua.pt} \\
\href{mailto:hrmalon@ua.pt}{\tt hrmalon@ua.pt}\\
\ \\
M.~Irene Falc\~{a}o \\
CMAT and  Department of Mathematics and Applications \\
University of Minho\\
4710-057 Braga\\
Portugal\\
\href{mailto:mif@math.uminho.pt}{\tt mif@math.uminho.pt}\\
\ \\
Gra\c{c}a Tomaz \\
CIDMA and Research Unit for Inland Development\\
Department of Mathematics\\
Polytechnic of Guarda\\6300-659 Guarda\\Portugal\\
\href{mailto: gtomaz@ipg.pt}{\tt gtomaz@ipg.pt} \\
\end{center}

\vskip .2 in


\begin{abstract}
In this paper we combine the knowledge of different structures of a special Appell multidimensional
polynomial sequence  with the problem of establishing combinatorial identities. The elements of this special polynomial sequence have values in a Clifford algebra, are homogeneous hypercomplex differentiable functions of different degrees and their coefficients properties can be used to stress interesting matrix and combinatorial relations.
\end{abstract}


\section{Motivation}\label{sec:1}

The construction of polynomials with values in a Clifford algebra, based on Appell's concept of power-like polynomials,
has been considered in a series of articles by authors of this paper \cite{AcetoMalonekTomaz2017,CacaoFalcaoMalonek2012,CacaoFalcaoMalonek2017,FalcaoCruzMalonek2006,FalcaoMalonek2007,MalonekFalcao2007}. The consideration of these polynomials was motivated by the fact that positive integer powers of the usually considered hypercomplex variable are not holomorphic, except for the complex case, while hypercomplex Appell polynomials are hyperholomorphic and have the behavior of power-like functions under hypercomplex differentiation. The study of sets of Appell polynomials became a focus of many authors attention, due to their theoretical importance and interesting applications \cite{BockGurlebeck2010,CacaoMalonek2008,CacaoFalcaoMalonek2011, CacaoMalonek2011a, CruzFalcaoMalonek2011, Eelbode2012,Guerlebeck2009,Lavicka2010,Lavicka2012,MoraisLe2011}. 

The knowledge of different hypercomplex polynomial bases systems can be combined with the problem of establishing and proving new combinatorial identities by bijective methods, linking in this way  Clifford analysis and combinatorics. This idea was considered in the works \cite{CacaoFalcaoMalonek2017a,CruzFalcaoMalonek2014,FalcaoMalonek2012b,MalonekFalcao2011}, illustrating  that the use of the underlying noncommutative algebra can lead to generalizations of known results but, at the same time, opens the way for deriving new useful formulas and combinatorial identities.

In this work we pursued the idea of considering (non-standard) applications of Clifford algebras in the solution of problems of  combinatorial nature, pointing out new combinatorial aspects of generalized Appell polynomials associated with two different representations. The paper is organized as follows: in Section 2 we introduce the necessary notation from Clifford analysis and describe briefly
a set of homogeneous  polynomials $(\Pk^n(x))$ generalizing  the complex power function $z^k$. Two different representations of the polynomials $\Pk^n(x)$ allow to derive, in Section 3, interesting matrix and combinatorial relations between their coefficients.
In Section 4, a family of Pascal trapezoids closely related to the problem considered in the previous section is introduced and several patterns in such structure are studied.

\section{A multidimensional polynomial sequence}\label{sec:2}




Let $\{e_1,e_2,\dots,e_n\},  n\ge 2,$ be an orthonormal basis of the Euclidean vector space $\R^{n}$  with a non-commutative
product given according to the multiplication rules $$e_i e_j +e_j e_i =-2\delta_{ij},\quad i,j=1,2,\dots,n,$$
where $\delta_{ij}$ is the Kronecker symbol. 
A basis for the  associative $2^n$-dimensional real Clifford algebra $\Cl$  is the set $\{e_A: A\subseteq\; \{ 1,\dots,n\}\}$
with $$e_A=e_{h_1}e_{h_2}\cdots e_{h_r},\quad 1\leq h_1&lt; \cdots &lt; h_r\leq n,\quad e_{\emptyset}=e_0=1.$$  
In general, the vector space $\R^{n+1}$ is embedded in $\Cl$ by identifying the element $(x_0,\dots,x_n)$ in $\R^{n+1}$ with the so-called paravector
$$x=x_0+\sum_{k=1}^ne_kx_k=x_0+\xv\in\A_n:=\text{span}_{\R}\{1,e_1,\dots,e_n\}\subset \Cl.$$
The conjugate $\bar{x}$ and the norm $|x|$ of $x$ are given by $\bar{x}=x_0-\xv$ and $|x|=(x\bar{x})^{1/2}=(\bar{x}x)^{1/2}=\left(\sum_{k=0}^nx_k^2\right)^{1/2}$.

The generalized Cauchy-Riemann operator in $\R^{n+1}$ is defined by 
$$\overline{\partial}:=\frac{1}{2}(\partial_0+\partial_{\xv}),$$
with $\partial_0:=\frac{\partial}{\partial {x_0}}\;\;\hbox{and}\;\; \partial_{\xv}:=\sum_{k=1}^ne_k\frac{\partial}{\partial x_k}.$ The conjugate generalized Cauchy-Riemann operator, also called the hypercomplex differential operator, is denoted by
$$\partial:=\frac{1}{2}(\partial_0-\partial_{\xv}).$$
  
Functions defined in an open subset $ \Omega \subseteq \R^{n+1}\cong \A_n$ with values in the Clifford algebra $ \Cl$ are of the form $f(z)=\sum_A f_A(z)e_A$, with $f_A(z)$ real valued.

A function $f$ is called \emph{left} (\emph{right}) \emph{monogenic} in  $\Omega$ if it is a solution of the differential equation
$\overline{\partial}f=0$ ($f\overline{\partial}=0$).

The hypercomplex differentiability as generalization of complex differentiability has to be understood in the following way: a 
function $f$ defined in an open domain $\Omega \subseteq \R^{n+1}$ is hypercomplex differentiable if it has a uniquely defined areolar derivative $f'$ in each point of $\Omega$. Then, $f$ is real differentiable and $f'=\partial f$. Furthermore,  $f$ is hypercomplex 
differentiable in $\Omega$ if and only if $f$ is monogenic.  In addition, the monogenicity of $f$ implies that  $f'=\partial_0f=-\partial_{\xv}f$ (see \cite{GuerlebeckMalonek1999, Malonek2004}).

Throughout this paper, a sequence of real numbers is denoted by  $(a_k)_{k}$ or simply $(a_k)$. A finite $k$-tuple of numbers can be seen as an infinite sequence by adding zeros to the end.

We consider particular polynomial sequences  ${(\Pk^n(x))}_k$ whose terms are homogeneous monogenic polynomials of degree $k$, taking their values in $\A_n$, defined by
\begin{equation}\label{pkn:1}
\Pk^n(x)=\displaystyle{\sum_{s=0}^k}T_{s}^k(n)x^{k-s}\bar{x}^s,
\end{equation}
where
\begin{equation}\label{tks:1}
T_{s}^k(n)={k\choose s}\displaystyle{\tfrac{\left(\tfrac{n+1}2\right)_{k-s}\left(\tfrac{n-1}2\right)_{s}}{(n)_k}},
\end{equation}
and $(a)_r$ denotes the Pochhammer symbol, i.e., $(a)_r:=\tfrac{\Gamma (a+r)}{\Gamma(a)},\; r\geq 1$, and $(a)_0:=1$. Such polynomials were introduced initially \cite{FalcaoMalonek2007,MalonekFalcao2007} as functions of a paravector variable $x$ and its conjugate $\bar{x}$  and the coefficients $T_{s}^k(n)$ were calculated in such a way that  $(\Pk^n(x))$ is a generalized Appell  sequence of monogenic homogeneous  polynomials with respect to $\partial$, i.e.,
\begin{enumerate}
\item $ \P_0^n(x)=1,$
\item $ \partial \Pk^n(x)=k\P_{k-1}^n(x),\;\;k=1,2,\dots.$
\end{enumerate} 

In the context of this paper,  the representation of the Appell polynomials \eqref{pkn:1} in the form
\begin{equation}\label{pkn:2}
\Pkn(x)=\sum_{s=0}^{k}\,{k\choose s}\,c_s(n)\,{x_0^{k-s}\,\xv^s},
\end{equation}
will play an important role. Such representation  has been studied in a series of papers (see, e.g., \cite{FalcaoMalonek2007, FalcaoMalonek2012b,MalonekFalcao2010}), where, in particular, it is proved that the coefficients are given by
\begin{equation}\label{ck}
c_{s}(n)=
\begin{cases}
\tfrac{s!!(n-2)!!}{(n+s-1)!!},&amp;\text{if $s$  is odd;}\\
c_{s-1}(n),&amp;\text{if $s$ is even,}
\end{cases}
\end{equation}
and satisfy 
\begin{equation}\label{alternating sum}
c_k(n)=\sum_{s=0}^k (-1)^s T_{s}^k(n),\ k=0,1,\dots.
\end{equation}
In the relation \eqref{ck}, $n!!$ denotes the usual double factorial of
$n$, which (we recall) is defined as $n!!=n(n-2)!!$ for $n&gt;1$, and
$0!!=1!!=1$.

	It is also worth mentioning that the numbers $T_{s}^k(n)$, for each degree $k$, constitute a partition of unity, i.e.,
\begin{equation}\label{partition}
1=\sum_{s=0}^k  T_{s}^k(n),\ k=0,1,\dots,
\end{equation}
(cf.\ \cite[Thm.\ 3.7]{FalcaoMalonek2012b}).

The family of numbers composed by $T_s^k (n)$, can be represented  as a triangular table  with lines of height $k = 0, 1, \dots$ and ordered from $s = 0$ up to $s = k$. Table~\ref{table:1} shows its first lines followed by the first terms of the sequences  $(c_{k}(n))$.
Table~\ref{table:2}  contains the first  numbers associated with $(T_{s}^k(2))$ and $(T_{s}^k(3))$, while in Table~\ref{table:3} we collect the first  elements of the sequences $c_{2k}(n)$, (for $n=2,\dots,7$). In the latter two tables one can see connections between $(c_{2k}(n))$  and $(T_s^k(n))$ with sequences from The On-Line Encyclopedia of Integer Sequences (OEIS) \cite{OEIS}.

\begin{table}
\caption{ The triangles  $(T_s^k(n))$ and the sequences $(c_k(n))$}\label{table:1}
\begin{center}
\begin{tabular}{l}\hline \\[-2ex]
$T_s^k(n)$ \\[0.5ex] \hline\\[-2ex]
$\begin{array}{llllll}
 1 \\[1ex]
\tfrac{n+1}{2n}&amp;  \tfrac{n-1}{2n}\\[1ex]
 \tfrac{n+3}{4n}&amp;  \tfrac{n-1}{2n}&amp;\  \tfrac{n-1}{4n}\\[1ex]
 \tfrac{(n+5)(n+3)}{8n(n+2)}&amp;  \tfrac{3(n+3)(n-1)}{8n(n+2)}&amp;  \tfrac{3(n^2-1)}{8n(n+2)}&amp;\
\tfrac{(n+3)(n-1)}{8n(n+2)}\\[1ex]
 \tfrac{ (n+5)(n+7)}{16n(n+2)}&amp;  \tfrac{(n+5)(n-1)}{4n(n+2)}&amp;   \tfrac{3(n^2-1)}{8n(n+2)}&amp;\
\tfrac{(n^2-1)}{4n(n+2)}&amp;  \tfrac{(n+5)(n-1)}{16n(n+2)}\\[1ex]
 \tfrac{ (n+5)(n+7)(n+9)}{32n(n+2)(n+4)}&amp;  \tfrac{5(n+7)(n+5)(n-1)}{32n(n+2)(n+4)}&amp;   \tfrac{5(n^2-1)(n+5)}{16n(n+2)(n+4)}&amp;
\tfrac{5(n^2-1)(n+3)}{16n(n+2)(n+4)}&amp;\tfrac{5(n^2-1)(n+5)}{32n(n+2)(n+4)}&amp; \tfrac{(n+5)(n-1)(n+7)}{32n(n+2)}\\[1ex] 
\qquad\quad \vdots
\end{array}$\\\hline\\[-2ex]
$c_k(n)=1,\tfrac{1}{n},\tfrac{1}{n},\tfrac{3}{n^2+2 n},\tfrac{3}{n^2+2 n},\tfrac{15}{n \left(n^2+6 n+8\right)},\tfrac{15}{n \left(n^2+6 n+8\right)},\tfrac{105}{n (n+2) (n+4) (n+6)},\tfrac{105}{n (n+2) (n+4) (n+6)},\dots$\\[1ex] \hline 
\end{tabular}
\end{center}
\end{table}


\begin{table}
\caption{ First rows of $(T_s^k(2))$ and  $(T_s^k(3))$ and the links to  OEIS}\label{table:2}
\begin{center}
\begin{tabular}{ll}\hline 
$n=	2$ &amp; $n=3$\\ \hline
$\begin{array}{cccccc}
1\\[1ex]
\tfrac34&amp;\tfrac14\\[1ex]
\tfrac{10}{16} &amp; \tfrac{4}{16} &amp; \tfrac{2}{16} \\[1ex]
\tfrac{35}{64} &amp; \tfrac{15}{64} &amp; \tfrac{9}{64} &amp; \tfrac{5}{64} \\[1ex]
\tfrac{126}{256} &amp; \tfrac{56}{256} &amp; \tfrac{36}{256} &amp; \tfrac{24}{256} &amp; \tfrac{14}{256} \\[1ex]
\vdots
\end{array}$
&amp;
$\begin{array}{cccccc}
1\\[1ex]
\tfrac23&amp;\tfrac13\\[1ex]
\tfrac36 &amp; \tfrac26 &amp; \tfrac16 \\[1ex]
\tfrac{4}{10} &amp; \tfrac{3}{10} &amp; \tfrac{2}{10} &amp; \tfrac{1}{10} \\[1ex]
\tfrac{5}{15} &amp; \tfrac{4}{15} &amp; \tfrac{3}{15} &amp; \tfrac{2}{15} &amp; \tfrac{1}{15} \\[1ex]
\vdots\end{array}$
\\ \\
$T_s^k(2)=\tfrac{\seqnum{A078817} (k(k+1)/2+s)}{\seqnum{A000302} (k)}$
$T_s^k(3)=\tfrac{\seqnum{A004736} (k(k+1)/2+s)}{\seqnum{A026741} (k+2)}$\\ \\ \hline 
\end{tabular}
\end{center}
\end{table}

\begin{table}[t]
\caption{First elements of $(c_{2k}(n))$, ($n=2,\dots,7$) and the links to OEIS}\label{table:3}
\begin{center}
\begin{tabular}{ll}\hline\\[-2ex]
$c_{2k}(2)=1,\tfrac12,\tfrac38,\tfrac5{16},\tfrac{35}{128},\tfrac{63}{256},\tfrac{231}{1024},\dots$&amp;=$\tfrac{\seqnum{A001790}  (k)}{\seqnum{A046161} (k)}$\\[1.5ex]
$c_{2k}(3)=1,\tfrac13,\tfrac15,\tfrac17,\tfrac19,\tfrac{1}{11},\tfrac{1}{13},\dots $&amp;=$\tfrac1{\seqnum{A005408} (k)}$\\[1.5ex]
$c_{2k}(4) =1,\tfrac14,\tfrac18,\tfrac5{64},\tfrac{7}{128},\tfrac{21}{512},\tfrac{33}{1024},\dots$&amp;=$\tfrac{\seqnum{A098597}  (k)}{\seqnum{A120777} (k)}$\\[1.5ex]
$c_{2k}(5) =\tfrac33,\tfrac3{15},\tfrac3{35},\tfrac3{63},\tfrac3{99},\tfrac{3}{143},\tfrac{3}{195},\dots$&amp;=$\tfrac3{\seqnum{A000466} (k +1)}$\\[1.5ex]
$c_{2k}(6) =1,\tfrac16,\tfrac1{16},\tfrac1{32},\tfrac{7}{384},\tfrac{3}{256},\tfrac{33}{4096},\dots$&amp;=$\tfrac{\seqnum{A099398}  (k)}{\seqnum{A099399} (k)} $\\[1.5ex]
$c_{2k}(7) =\tfrac55,\tfrac5{35},\tfrac5{105},\tfrac5{231},\tfrac5{429},\tfrac{5}{715},\tfrac{5}{1105},\dots$&amp;=$\tfrac5{\seqnum{A162540} (k)}$\\[1ex]
\hline 
\end{tabular}
\end{center}
\end{table}

In the recent work \cite{CacaoFalcaoMalonek2017a}, authors of this paper constructed a sequence $(m_k)$ closely related to $(c_k(2))$.  Analyzing the sequence $(T_0^k(2))$ (cf.\ Table~\ref{table:2})
$$1,\tfrac{3}{4},\tfrac{5}{8},\tfrac{35}{64},\tfrac{63}{128},\tfrac{231}{512},\tfrac{429}{1024},\tfrac{6435}{16384},\tfrac{12155}{32768},\tfrac{46189}{131072},\tfrac{88179}{262144},\dots$$
one can see that it consists of  rational numbers whose denominators are  strictly increasing powers of 2. The sequence $(m_k)$ of the  corresponding exponents,
\begin{equation*}
0,2,3,6,7,9,10,14,15,17,18,\dots
\end{equation*}
is called, in \cite{CacaoFalcaoMalonek2017a},   the  {\sl minimal exponent  integer sequence} with respect to 2, since it represents the \textsl{least non-negative integer} $m_k$ such that $2^{m_k}T_0^k\in\N$.
The general expression of $m_k$  reads as follows: 
\begin{equation*}\label{mk:1}
m_k=k+ \big\lfloor{\tfrac{k+1}{2}}\big\rfloor+\big\lfloor{\tfrac{k+1}{2^2}}\big\rfloor +\cdots+ \big\lfloor{\tfrac{k+1}{2^m}}\big\rfloor,
\end{equation*}
with $m \leq \log_2 (k+1)$, (see \cite[Thm.~6]{CacaoFalcaoMalonek2017a} for details). The sequence, now listed in OEIS as \seqnum{A283208},
allows to write
\begin{equation*}
T_0^k(2)=2c_{2k+1}(2)=\dfrac{\seqnum{A001790}  (k+1)}{2^{\seqnum{A283208}(k)}}.
\end{equation*}
 

\section{Connection-like identities}\label{sec:3}

\textit{Connection-like} is here understood as the problem of linking the coefficients  $T_s^k(n)$ and $c_s(n)$ associated with the two representations \eqref{pkn:1} and \eqref{pkn:2} of the same polynomial sequence $(\Pk^n(x))$. In this section we describe bijections between those coefficients and present corresponding matrix relations.

We let ${\mathbf T}_{k}(n)$ and ${\mathbf C}_{k}(n)$ denote the $(k+1)$-dimensional vectors
\begin{equation*}
{\mathbf T}_{k}(n)=
 \begin{bmatrix}
 T_{0}^k(n)&amp;
T_{1}^k(n)&amp;
 \cdots &amp;
T_{k-1}^k(n)&amp;
T_{k}^k(n)
\end{bmatrix}^T
\end{equation*}
and
\begin{equation*}
{\mathbf C}_{k}(n)=
\begin{bmatrix}
c_{0}(n)&amp;
c_{1}(n)&amp;
\cdots &amp;
c_{k-1}(n)&amp;
c_{k}(n)
\end{bmatrix}^T.
\end{equation*}


We start with a technical result relating the numbers \eqref{tks:1} in the row $k-i$ with their  distant neighbors in the row $k$.
\begin{lemma}\label{Lemma1}
For any fixed value of $k\ge 1$, the following relation holds:
\begin{equation}\label{eq:6}
T_s^{k-i}(n)=\sum_{j=0}^iA(k,i,s,j)T_{s+j}^k(n);\ i=1,\dots,k,\ s=0,\dots,k-i,
\end{equation}
where
\begin{equation}\label{As}
A(k,i,s,j)={i\choose j}\tfrac{\left(k-i-s+1\right)_{i-j}\left(s+1\right)_{j}}{\left(k-i+1\right)_{i}}.
\end{equation}
\end{lemma}

\begin{proof}  The result is true for $i=1$, since \eqref{eq:6} reads as
\begin{equation}\label{Th3.5}
T_s^{k-1}(n)=\tfrac{k-s}kT_s^{k}(n)+\tfrac{s+1}kT_{s+1}^{k}(n),\ \ s=0,\dots,k-1.
\end{equation}
This relation between  an element in row $k-1$ and two adjacent elements in the row $k$ was already proved in  \cite[Thm.\ 3.5]{FalcaoMalonek2012b}.

The repeated use of \eqref{Th3.5} allows to express an element in row $k-i$ in terms of $i+1$ adjacent elements in the row $k$. In fact, for  $s=0,\dots,k-2$ one can write
\begin{align*}
T_s^{k-2}(n)&amp;=\tfrac{k-s-1}{k-1}T_s^{k-1}(n)+\tfrac{s+1}{k-1}T_{s+1}^{k-1}(n)\\
&amp;=\tfrac{k-s-1}{k-1}\big(\tfrac{k-s}kT_s^{k}(n)+\tfrac{s+1}kT_{s+1}^{k}(n)\big)+\tfrac{s+1}{k-1}\big(\tfrac{k-s-1}kT_{s+1}^{k}(n)+\tfrac{s+2}kT_{s+2}^{k}(n)\big)\\
&amp;=\tfrac{(k-s-1)_2}{(k-1)_2}T_s^{k}(n)+\tfrac{2(k-s-1)(s+1)}{(k-1)_2}T_{s+1}^{k}(n)+\tfrac{(s+1)_2}{(k-1)_2}T_{s+2}^{k}(n).
\end{align*}
Applying the same reasoning we have 
\begin{align*}
T_s^{k-3}(n)&amp;=\tfrac{(k-s-2)_3}{(k-2)_3}T_s^{k}(n)+\tfrac{3(k-s-2)_2(s+1)}{(k-2)_3}T_{s+1}^{k}(n)+\tfrac{3(k-s-2)(s+1)_2}{(k-2)_3}T_{s+2}^{k}(n)+\tfrac{(s+1)_3}{(k-2)_3}T_{s+3}^{k}(n)\\
&amp;\vdots\\
T_s^{k-i}(n)&amp;=\sum_{j=0}^i\tbinom{i}{j}\tfrac{(k-s-i+1)_{i-j}(1+s)_j}{(k-i+1)_i}T_{s+j}^k(n)
\end{align*}
and the result is proved.
\end{proof}

The next result is a generalization to arbitrary dimensions of Theorem~2 in \cite{MalonekFalcao2007} (see also \cite{FalcaoCruzMalonek2006}).

\begin{theorem}\label{Theorem1} The components $T_{s}^k(n)$ and $T_{s}^{k-1}(n)$ of the vectors $\mathbf T_k(n)$ and $\mathbf T_{k-1}(n)$, respectively,
satisfy the  $(k+1)\times(k+1)$ system of algebraic equations represented in  matrix form as
\begin{equation*}
M_k {\mathbf T}_k(n)=\left[
\begin{array}{c}\\
k{\mathbf T}_{k-1}(n)\\[2ex]
\hdashline \\[-1ex]
c_{k}(n)
\end{array}
\right],
\end{equation*}
 where $M_k$ is given by
\begin{align}\label{Mk}
M_k&amp;:=\left[
\begin{array}{ccccccc}
k&amp;1&amp;0&amp;0&amp;\cdots&amp;0&amp;0\\
0&amp;k-1&amp;2&amp;0&amp;\cdots&amp;0&amp;0\\
0&amp;0&amp;k-2&amp;3&amp;\cdots&amp;0&amp;0\\
\vdots&amp;\vdots&amp;\vdots&amp;\vdots&amp;\ddots&amp;\vdots&amp;\vdots \\
0&amp;0&amp;0&amp;0&amp;\cdots&amp;k-1&amp;0\\
0&amp;0&amp;0&amp;0&amp;\cdots&amp;1&amp;k\\
1&amp;-1&amp;1&amp;-1&amp;\cdots &amp;(-1)^{k-1}&amp;(-1)^k
\end{array}
\right],\;\; k\geq 1.
\end{align}
  
\end{theorem}

\begin{proof} It is a simple consequence of relation \eqref{Th3.5} together with the alternating sum  formula \eqref{alternating sum}  for $c_k(n)$. 
\end{proof}

\begin{lemma}\label{Lemma2} The matrix $M_k$ $(k=1,2,\dots)$  in \eqref{Mk}  is nonsingular and
\begin{equation*}
\det M_k=(-2)^kk!.
\end{equation*}

\begin{proof}
Developing the determinant along the last row, we obtain
\begin{align*}
\det M_k=&amp;(-1)^{k+2}k!-(-1)^{k+3}k \tfrac{k!}{1!}+(-1)^{k+4}k(k-1) \tfrac{k!}{2!}-(-1)^{k+5}k(k-1)(k-2) \tfrac{k!}{3!}\\
&amp;+\cdots+(-1)^k k(k-1)(k-2)\cdots 1 \tfrac{k!}{k!}\\
=&amp; (-1)^kk!\left(1+\tfrac{k}{1!}+\tfrac{k(k-1)}{2!}+\tfrac{k(k-1)(k-2)}{3!}+\cdots+\tfrac{k!}{k!}\right)\\
=&amp;(-1)^kk!\sum_{j=0}^k\tbinom{k}{j}=(-1)^kk!2^k.
\end{align*}
\end{proof}
\end{lemma}

\begin{remark} We point out that $\det M_k=(-1)^k\seqnum{A000165}(k)$.\end{remark}  

As a consequence of the previous results one can derive recursive matrix relations between the vectors ${\mathbf T}_k(n)$ and $ \mathbf C_k(n)$.

\begin{theorem}\label{Theorem2}
The values of $T_{s}^k(n)$ and
$c_{s}(n)$, $k=0,1,\dots$, $s=0,1,\dots,k$, are related by the following matrix relation
\begin{equation}\label{sistema2}
{\mathbf T}_k(n)=N_k \mathbf C_k(n),
\end{equation}
where $N_k$ is recursively defined by
\begin{align}
N_0=&amp;1\nonumber\\
N_k=&amp; M_k^{-1}\left[
\begin{array}{c:c}
kN_{k-1}\phantom{\dfrac12}&amp;\mathbf 0\\
\hdashline
\mathbf 0&amp;1
\end{array}
\right],\ k=1,2,\dots. \label{Nk}
\end{align}
Moreover, if we denote by $\widetilde{N}_k$ the matrix $N_k^{-1}$ then we have
\begin{equation} \label{sistema3}
\mathbf C_k(n)=\widetilde{N}_k{\mathbf T}_k(n),
\end{equation}
where
\begin{align}
\widetilde{N}_0=&amp; 1\nonumber\\
\widetilde{N}_k=&amp; \left[
\begin{array}{c:c}
\tfrac1{k} \widetilde{N}_{k-1}\phantom{\dfrac12}&amp;\mathbf 0\\
\hdashline
\mathbf 0&amp;1
\end{array}
\right]M_k,\ k=1,2,\dots. \label{NNk}
\end{align}
\end{theorem}

\begin{proof} To prove the relations \eqref{sistema2}-\eqref{Nk} we use an inductive process on  $k$. Taking into account  Theorem~\ref{Theorem1} and the fact that $T_{0}^0(n)=1=c_0(n)$, one can write, for $k=1$,
$$ {\mathbf T}_{1}(n)=M_1^{-1}\left[
\begin{array}{c}
{\mathbf T}_{0}(n) \\
\hdashline
c_1(n)
\end{array}
\right]=M_1^{-1}\left[
\begin{array}{c:c}
1&amp;0 \\
\hdashline
0&amp;1
\end{array}
\right]\left[ \begin{array}{c}
c_0(n) \\
\hdashline
c_1(n)
\end{array}
\right]=N_1{\mathbf C}_{1}(n),$$with $N_1=M_1^{-1} \left[\begin{array}{c:c}
1 N_0&amp;0 \\
\hdashline
0&amp;1
\end{array}
\right]$.
 
Now  assume that ${\mathbf T}_{k}(n)=N_k{\mathbf C}_{k}(n)$ holds for $k$. For $k+1$ one has
\begin{align*}{\mathbf T}_{k+1}(n)&amp;=M_{k+1}^{-1}\left[
\begin{array}{c}
(k+1){\mathbf T}_{k}(n) \\
\hdashline
c_{k+1}(n)
\end{array}
\right]=M_{k+1}^{-1}\left[
\begin{array}{c}
(k+1)N_k{\mathbf C}_{k}(n) \\
\hdashline
c_{k+1}(n)
\end{array}
\right]\\
&amp;=M_{k+1}^{-1}\left[
\begin{array}{c:c}
(k+1)N_k&amp;{\mathbf{0}} \\
\hdashline
{\mathbf{0}}&amp;1
\end{array}
\right]\left[
\begin{array}{c}
{\mathbf C}_{k}(n) \\
\hdashline
c_{k+1}(n)
\end{array}
\right]=N_{k+1}{\mathbf C}_{k+1}(n),
\end{align*} 
with  $N_{k+1}=M_{k+1}^{-1}\left[\begin{array}{c:c}
(k+1) N_k&amp;{\mathbf{0}} \\
\hdashline
{\mathbf{0}}&amp;1
\end{array}
\right]$.
 
To prove the relations \eqref{sistema3}-\eqref{NNk}, observe that $N_k$ is invertible, since
\begin{align*}
\det N_k=&amp;k^k\det M_k^{-1}\det N_{k-1}=\tfrac{k^k}{k!(-2)^k}\det N_{k-1}\\
=&amp;(-\tfrac{k}2)^k\tfrac1{k!}(-\tfrac{k-1}2)^{k-1}\tfrac1{(k-1)!}\det N_{k-2}=\cdots=\prod_{m=1}^k(-\tfrac{m}2)^m\tfrac1{m!}.
\end{align*}
The inversion of $N_k$ leads to  the desired result.
\end{proof}

The next result allows to express each  component of the vector ${\mathbf T}_{k}(n)$  as a linear combination of $c_0(n),\dots,c_k(n)$.

\begin{theorem}\label{Theorem3}
The numbers $T_{s}^k(n)$, $k=0,1,\dots$, $s=0,1,\dots,k$, can be written as
\begin{equation}\label{t1}
T_{s}^k(n)=\tfrac1{2^k}{k\choose s}\sum_{j=0}^k \sigma_{s,j}^{k}c_j(n),
\end{equation}
where
\begin{equation}\label{sigma}
\sigma_{s,j}^{\,k}=  \sum_{m=0}^s (-1)^{m}{s\choose m}{k-s\choose j-m}.
\end{equation}
\end{theorem}

\begin{proof} Replacing $x_0=\tfrac{x+\bar x}2$ and $\xv=\tfrac{x-\bar x}2$ in
\eqref{pkn:2} we obtain successively\footnote{For convenience we include binomial coefficients ${n\choose k}$ for nonnegative integer $n$ and integer $k$ such that $k&lt;0$ or $k&gt;n$, which as usually are considered to be zero.}
\begin{align*}
\Pkn(x)=&amp; \tfrac1{2^k}\sum_{j=0}^{k}\,{k\choose j}\,c_j(n)\,{(x+\bar x)^{k-j}\,(x-\bar x)^j}\\
=&amp; \tfrac1{2^k}\sum_{j=0}^{k}\,{k\choose j}\,c_j(n)\Biggl(\sum_{t=0}^{k-j}{k-j\choose t}x^{k-j-t}\bar x^t\Biggl)\Biggl(\sum_{l=0}^j(-1)^l{j\choose l}x^{j-l}\bar x^l\Biggl)\\
=&amp;\tfrac1{2^k}\sum_{j=0}^{k}{k\choose j}\,c_j(n)\,\sum_{s=0}^{k}\sum_{m=0}^{s}(-1)^{s-m}{k-j\choose m}{j\choose s-m}x^{k-s}\bar x^s\\
=&amp;\tfrac1{2^k}\sum_{j=0}^{k}{k\choose j}\,c_j(n)\,\sum_{s=0}^{k}\sum_{m=0}^{s}(-1)^{m}{k-j\choose s-m}{j\choose m}x^{k-s}\bar x^s.
\end{align*}

By comparing last expression with \eqref{pkn:1} we obtain
\begin{equation*}
T_{s}^k(n)=\tfrac1{2^k}\sum_{j=0}^k {k\choose j}c_j(n)\sum_{m=0}^s (-1)^{m}{k-j\choose s-m}{j\choose m}.
\end{equation*}
The result follows, since ${k\choose j}{k-j\choose s-m}{j\choose m}={k\choose s}{s\choose m}{k-s\choose j-m}$.
\end{proof}

The explicit expression of each $c_{j}(n)$, $j=0,\dots,k$, as a linear combination of $ T_{s}^k(n)$, $s=0,\dots,k$, reads as follows.
\begin{theorem}\label{Theorem4}
For any fixed value of $k$, the coefficients $c_{k-i}(n)$ can be written as
\begin{equation}\label{ck:2}
c_{k-i}(n)=\frac{1}{{k\choose i}}\sum_{s=0}^k(-1)^s\sigma_{s,i}^{k}T_s^k(n),\ i=0,1,\dots,k.
\end{equation}

\end{theorem}

\begin{proof}
Using Lemma~\ref{Lemma1} together with \eqref{alternating sum} we obtain
\begin{align*}
c_{k-i}(n)&amp; = \sum_{s=0}^{k-i}(-1)^sT_s^{k-i}(n)
= \sum_{s=0}^{k-i}(-1)^s \sum_{j=0}^{i}A(k,i,s,j)T_{s+j}^k\\
&amp; =\sum_{j=0}^{i}A(k,i,0,j)T_{j}^k-\sum_{j=1}^{i}A(k,i,1,j-1)T_{j}^k+\cdots +(-1)^{k-i}\sum_{j=k-i}^{k}A(k,i,k-i,j-k+i)T_{j}^k.
\end{align*}
Observe that if we allow in the expression \eqref{As} of $A(k,i,s,j)$ $s$ and $j$ to be arbitrary integers, then $A(k,i,s,j)$
vanishes whenever $j&gt;i$ or $j&lt;0$ or $k\le s+i-1$. Therefore we can write
\begin{align*}
c_{k-i}(n)&amp;=\sum_{j=0}^{k}A(k,i,0,j)T_{j}^k-\sum_{j=0}^{k}A(k,i,1,j-1)T_{j}^k+\cdots +(-1)^{k-i}\sum_{j=0}^{k}A(k,i,k-i,j-k+i)T_{j}^k\\
&amp;=\sum_{s=0}^k\sum_{m=0}^{k-i}(-1)^mA(k,i,m,s-m)T_s^k(n)
\end{align*}
or, equivalently
\begin{equation*}
c_{k-i}(n)=\begin{cases}
\displaystyle\sum_{s=0}^k\big(\sum_{m=0}^{s}(-1)^mA(k,i,m,s-m)+\sum_{m=s+1}^{k-i}(-1)^mA(k,i,m,s-m)\big)T_s^k(n),&amp;\text{if } k-i\ge s;\\[2ex]
\displaystyle\sum_{s=0}^k\big(\sum_{m=0}^{s}(-1)^mA(k,i,m,s-m)-\!\sum_{m=k-i+1}^{s}(-1)^mA(k,i,m,s-m)\big)T_s^k(n),&amp;\text{if } k-i&lt; s.\\
\end{cases}
\end{equation*}
Since $A(k,i,m,s-m)=0$, for $m&gt; s$, the sum $\sum_{m=s+1}^{k-i}(-1)^mA(k,i,m,s-m)$ is zero. On the other hand, we also have $A(k,i,m,s-m)=0$  in
$\sum_{m=k-i+1}^{s}(-1)^mA(k,i,m,s-m)$, since $k\le m+i-1$.
We have proved that
\begin{equation*}
c_{k-i}(n)=\sum_{s=0}^k\vartheta_{i,s}^{k}T_s^k(n),\  i=0,\dots, k,
\end{equation*}
where
\begin{equation*}
\vartheta_{i,s}^{k}=\sum_{m=0}^{s}(-1)^mA(k,i,m,s-m),\  i=0,\dots, k.
\end{equation*}
The use of \eqref{As} allows to write
\begin{align*}
\vartheta_{i,s}^{k}&amp; = \sum_{m=0}^{s}(-1)^m\tfrac{i!}{(i-s+m)!(s-m)!}\tfrac{(k-i-m+1)\dots(k-s)(m+1) \dots s}{(k-i+1)\dots k}\\
&amp;=\sum_{m=0}^{s}(-1)^m\tfrac{i!(k-i)!}{k!}\tfrac{(k-s)!}{(i-s+m)!(k-i-m)!}\tfrac{s!}{(s-m)!m!}
=\tfrac{(-1)^s}{{k\choose i}}\sigma_{s,i}^{k}
\end{align*}
(cf.\ \eqref{sigma}) and the result follows.
\end{proof}

\begin{remark}
Since $\sigma_{s,k}^{k}=(-1)^s$, Theorem~\ref{Theorem4} contains as a particular case ($i=k$) the already known property \eqref{partition}.
\end{remark}

Theorem~\ref{Theorem2} can be used together with Theorems~\ref{Theorem3}  and \ref{Theorem4} to obtain the main result of this section: the explicit form of the matrix that relates vectors $\mathbf T_k(n)$ and $\mathbf C_k(n)$.

\begin{theorem}\label{Theorem5}
 Consider the coefficients $\sigma_{s,j}^{k}$ introduced in \eqref{sigma}. Then the following relations are true:
\begin{description}
\item[i)] ${\mathbf T}_k(n)=N_k \mathbf C_k(n)$,
 where  $N_k$ is the $(k+1)\times (k+1)$ matrix whose elements $n_{ij}^{k}$ are
\begin{equation*}
n_{ij}^{k}=\frac1{2^k}{k\choose i-1}\sigma_{i-1,j-1}^{k},\quad i,j=1,\dots,k+1.
\end{equation*}
\item[ii)]${\mathbf C}_k(n)=\widetilde{N}_k \mathbf T_k(n)$,
where  $\widetilde{N}_k$ is the $(k+1)\times (k+1)$ matrix whose elements $\widetilde{n}_{ij}^{k}$ are
\begin{equation*}
\widetilde{n}_{ij}^{k}=\tfrac{(-1)^{j-1}}{{k\choose k-i+1}}\sigma_{j-1,k-i+1}^{k},\quad i,j=1,\dots,k+1.
\end{equation*}
\end{description}


\end{theorem}
\begin{proof}
Observe that Theorem~\ref{Theorem3} can be expressed in matrix form as
\begin{equation*}
\mathbf T_k(n)=\tfrac1{2^k} S_k\mathbf C_k(n),
\end{equation*}
where $S_k$ is the $(k+1)\times(k+1)$ matrix whose elements $s_{ij}$ are such that
\begin{equation*}
s_{ij}={k\choose i-1}\sigma_{i-1,j-1}^{k},\ i,j=1,\dots,k+1.
\end{equation*}
Result i) follows at once from \eqref{sistema2}, while
result ii) is a simple consequence of Theorem~\ref{Theorem4}.
\end{proof}

The last theorem points out that the connection between ${\mathbf T}_k(n)$ and  ${\mathbf C}_k(n)$ is provided by the matrices $N_k$ and $\widetilde{N}_k$. However, a deeper observation permits to recognize that such connection is actually done by the coefficients $\sigma_{s,j}^{k}$, since they are the common factors in the coefficients of linear combinations (\ref{t1})-(\ref{ck:2}).
Examples of matrices $N_k, \widetilde{N}_k$, and vectors $\mathbf T_k(n), \mathbf C_k(n),\; k=1,\ldots,4,$ are given in  Table \ref{table:4}. 

\begin{center}
\begin{table}[t]
\caption{The matrices  $N_k$, $\widetilde N_k=N_k^{-1}$, and the vectors $\mathbf T_k(n)$, $\mathbf C_k(n)$, $(k=1,\dots,4)$}\label{table:4}
\small\begin{equation*}
\begin{array}{c|cccc}
k &amp; N_k&amp;\widetilde{N}_k&amp;\mathbf T_k&amp;\mathbf C_k\\
\hline\\
1&amp;
	\tfrac12\begin{bmatrix}
	1   &amp; 1  \\[1ex]
	1  &amp; -1
	\end{bmatrix}
	&amp;\begin{bmatrix}
	1   &amp; 1  \\[1ex]
	1  &amp; -1
	\end{bmatrix}
	&amp;
	\begin{bmatrix}
	\tfrac{n+1}{2n}  \\[2ex]
	\tfrac{n-1}{2n}
	\end{bmatrix}
	&amp;\begin{bmatrix}
	1  \\[2ex]
	\tfrac{1}{n}
	\end{bmatrix} \\[3ex]
2
	&amp; \tfrac1{2^2}\begin{bmatrix}
	1  &amp; 2 &amp; 1\\[1ex]
	2 &amp; 0 &amp; -2 \\[1ex]
	1  &amp;-2 &amp; 1
	\end{bmatrix}
	&amp;\begin{bmatrix}
	1  &amp; 1 &amp; 1\\[1ex]
	1 &amp; 0 &amp; -1 \\[1ex]
	1  &amp;-1 &amp; 1
	\end{bmatrix}
	&amp;\begin{bmatrix}
	\tfrac{n+3}{4n}  \\[2ex]
	\tfrac{n-1}{4n}\\[2ex]
	\tfrac{n-1}{2n}\\
	\end{bmatrix}
	&amp;\begin{bmatrix}
	1  \\
	\tfrac{1}{n}\\[1ex]
	\tfrac{1}{n}
	\end{bmatrix}\\[6ex]
3
	&amp; \tfrac1{2^3}\begin{bmatrix}
	1 &amp; 3 &amp; 3 &amp; 1\\[1ex]
	3 &amp; 3 &amp;-3 &amp; -3 \\[1ex]
	3 &amp; -3 &amp;-3 &amp; 3 \\[1ex]
	1 &amp; -3 &amp; 3 &amp; -1
	\end{bmatrix}
	&amp;
	\begin{bmatrix}
	1 &amp; 1 &amp; 1 &amp; 1\\[1ex]
	1 &amp; \tfrac13 &amp;-\tfrac13 &amp; -1 \\[1ex]
	1 &amp; -\tfrac13 &amp;-\tfrac13 &amp; 1 \\[1ex]
	1 &amp; -1 &amp; 1 &amp; -1
	\end{bmatrix}
	&amp;\begin{bmatrix}
	\tfrac{(3 + n) (5 + n))}{8 n (2 + n)}\\[2ex]
	\tfrac{3 (-1 + n) (3 + n)}{
		8 n (2 + n)}\\[2ex]
	\tfrac{3 (-1 + n)(1+n)}{8 n (2 + n)}\\[2ex]
	\tfrac{(-1 + n) (3 + n)}{
		8 n (2 + n)}
	\end{bmatrix}
	&amp;\begin{bmatrix}
	1 \\[2ex]
	\tfrac1{n} \\[2ex]
	\tfrac1{n}  \\[2ex]
	\tfrac3{n(n+2)}
	\end{bmatrix}\\[9ex]
	&amp; \tfrac1{2^4}\begin{bmatrix}
	1 &amp; 4 &amp; 6 &amp; 4 &amp; 1 \\
	4 &amp; 8 &amp; 0 &amp; -8 &amp; -4 \\
	6 &amp; 0 &amp; -12 &amp; 0 &amp; 6 \\
	4 &amp; -8 &amp; 0 &amp; 8 &amp; -4 \\
	1 &amp; -4 &amp; 6 &amp; -4 &amp; 1 \\
	\end{bmatrix}
	&amp;
	\begin{bmatrix}
	1 &amp; 1 &amp; 1 &amp; 1 &amp; 1 \\
	1 &amp; \tfrac{1}{2} &amp; 0 &amp; -\tfrac{1}{2} &amp; -1 \\
	1 &amp; 0 &amp; -\tfrac{1}{3} &amp; 0 &amp; 1 \\
	1 &amp; -\tfrac{1}{2} &amp; 0 &amp; \tfrac{1}{2} &amp; -1 \\
	1 &amp; -1 &amp; 1 &amp; -1 &amp; 1 
	\end{bmatrix}&amp;
	\begin{bmatrix}
	\tfrac{(n+5) (n+7)}{16 n (n+2)} \\[2ex] 
	\tfrac{(n-1) (n+5)}{4 n (n+2)} \\[2ex]
	\tfrac{3 (n-1)(n+1)}{8 n (n+2)}\\[2ex]
	\tfrac{(n-1)(n+1)}{4 n (n+2)} \\[2ex] 
	\tfrac{(n-1) (n+5)}{16 n (n+2)} 
	\end{bmatrix}
	&amp;\begin{bmatrix}
	1 \\
	\tfrac1{n} \\[2ex]
	\tfrac1{n}  \\[2ex]
	\tfrac3{n(n+2)}\\[2ex]
	\tfrac3{n(n+2)}
	\end{bmatrix}\\[2ex]
	\end{array}
	\end{equation*}
\end{table}
\end{center}
\section {A family of Pascal trapezoids}\label{sec:4}

In addition to providing the link between $T_s^k(n)$ and $c_s(n)$, the coefficients $\sigma_{i,j}^{k}$ (cf.\ \eqref{sigma}) in the identities \eqref{t1} and \eqref{ck:2} have several other interesting properties. In fact, considering  $i, j, k$ arbitrary nonnegative integers such that $j\le k$, the numbers $\sigma_{i,j}^{k}$ can be represented, for each fixed $i$, as a triangle  with rows $k$ ($k=0,1,\dots$) and ordered from $j=0$ to $j=k$, as illustrated in Table~\ref{table:5}. This section is dedicated to the study of various patterns in such structure and to the discussion of properties and combinatorial identities.

We observe that
\begin{enumerate}
\item  for $i=0$, we obtain the Pascal triangle, since $\sigma_{0,j}^{k}={k\choose j}$, (see first triangle in Table~\ref{table:5});
	
\item for $i=1$, $\sigma_{1,j}^{k}={k-1\choose j}-{k-1\choose j-1}=\tfrac{k-2j}{k}{k\choose j}$, which corresponds to the Catalan triangle numbers $C_{k,j}=\tfrac{k-2j}k{k\choose j}$ mentioned by Miana et al.\ \cite{MianaOhtsukaRomero2017}.
\end{enumerate}
 In general, for each fixed value of $i$, $\sigma_{i,j}^{k}$ can be obtained recursively, as stated in the following result.
\begin{center}
\begin{table}[t]
\caption{Triangles  associated with $\sigma_{i,j}^{k}$,  $(i=0,\dots, 3)$}\label{table:5}
\noindent $\begin{array}{c}
\def\objectstyle{\scriptstyle}
\def\labelstyle{\displaystyle}
\xymatrix @R=0.2pc @C=-0.4pc{
&amp;&amp;&amp;&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;&amp;&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 2&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 3&amp;&amp; 3&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 4&amp;&amp; 6&amp;&amp; 4&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 5&amp;&amp; 10&amp;&amp; 10&amp;&amp; 5&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;\ovalbox{\scriptsize1}&amp;&amp;6&amp;&amp;15&amp;&amp;20&amp;&amp;15&amp;&amp;6&amp;&amp;\ovalbox{\scriptsize1}\\
\ovalbox{\scriptsize1}&amp;&amp;7&amp;&amp;21&amp;&amp;35&amp;&amp;35&amp;&amp;21&amp;&amp;7&amp;&amp;\ovalbox{\scriptsize1}\\
\udots&amp;&amp;\udots&amp;&amp;\udots&amp;&amp;\udots&amp;&amp;\ddots&amp;&amp;\ddots&amp;&amp;\ddots&amp;&amp;\ddots\\ \\
&amp;&amp;&amp;&amp;&amp;&amp;&amp;i=0
}\quad
\xymatrix @R=0.2pc @C=-0.4pc{
&amp;&amp;&amp;&amp;&amp;&amp;&amp;\color{black!70}0\\ 
&amp;&amp;&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp;\ovalbox{\scriptsize-1}\\
&amp;&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 0&amp;&amp;\ovalbox{\scriptsize-1}\\
&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 1&amp;&amp;-1&amp;&amp;\ovalbox{\scriptsize-1}\\
&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 2&amp;&amp; 0&amp;&amp;-2&amp;&amp;\ovalbox{\scriptsize-1}\\
&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 3&amp;&amp; 2&amp;&amp;-2&amp;&amp;-3&amp;&amp;\ovalbox{\scriptsize-1}\\
&amp;\ovalbox{\scriptsize1}&amp;&amp;4&amp;&amp;5&amp;&amp;0&amp;&amp;-5&amp;&amp;-4&amp;&amp;\ovalbox{\scriptsize-1}\\
\ovalbox{\scriptsize1}&amp;&amp;5&amp;&amp;9&amp;&amp;5&amp;&amp;-5&amp;&amp;-9&amp;&amp;-5&amp;&amp;\ovalbox{\scriptsize-1}\\
\udots&amp;&amp;\udots&amp;&amp;\udots&amp;&amp;\udots&amp;&amp;\ddots&amp;&amp;\ddots&amp;&amp;\ddots&amp;&amp;\ddots\\ \\
&amp;&amp;&amp;&amp;&amp;&amp;&amp;i=1
}
\\ \\  
\def\objectstyle{\scriptstyle}
\def\labelstyle{\displaystyle}
\xymatrix @R=0.2pc @C=-0.3pc{
&amp;&amp;&amp;&amp;&amp;&amp;&amp;\color{black!70}2\\ 
&amp;&amp;&amp;&amp;&amp;&amp;\color{black!70}-2&amp;&amp;\color{black!70}-2\\
&amp;&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp;\ovalbox{\scriptsize-2}&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp;-1&amp;&amp;-1&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 0&amp;&amp;-2&amp;&amp; 0&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; 1&amp;&amp;-2&amp;&amp;-2&amp;&amp; 1&amp;&amp;\ovalbox{\scriptsize1}\\
&amp;\ovalbox{\scriptsize1}&amp;&amp;2&amp;&amp;-1&amp;&amp;-4&amp;&amp;-1&amp;&amp;2&amp;&amp;\ovalbox{\scriptsize1}\\
\ovalbox{\scriptsize1}&amp;&amp;3&amp;&amp;1&amp;&amp;-5&amp;&amp;-5&amp;&amp;1&amp;&amp;3&amp;&amp;\ovalbox{\scriptsize1}\\
\udots&amp;&amp;\udots&amp;&amp;\udots&amp;&amp;\udots&amp;&amp;\ddots&amp;&amp;\ddots&amp;&amp;\ddots&amp;&amp;\ddots\\ \\
&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;i=2}
\qquad
\xymatrix @R=0.2pc @C=-0.3pc{
&amp;&amp;&amp;&amp;&amp;&amp;&amp;\color{black!70}0\\
&amp;&amp;&amp;&amp;&amp;&amp;\color{black!70}6&amp;&amp;\color{black!70}-6\\
&amp;&amp;&amp;&amp;&amp;\color{black!70}-6&amp;&amp;\color{black!70}6&amp;&amp;\color{black!70}-6\\
&amp;&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp;\ovalbox{\scriptsize-3}&amp;&amp;\ovalbox{\scriptsize3}&amp;&amp;\ovalbox{\scriptsize-1}\\
&amp;&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; -2&amp;&amp; 0&amp;&amp;2&amp;&amp;\ovalbox{\scriptsize-1}\\
&amp;&amp;\ovalbox{\scriptsize1}&amp;&amp; -1&amp;&amp; -2&amp;&amp;2&amp;&amp;1&amp;&amp;\ovalbox{\scriptsize-1}\\
&amp;\ovalbox{\scriptsize1}&amp;&amp;0&amp;&amp;-3&amp;&amp;0&amp;&amp;3&amp;&amp;0&amp;&amp;\ovalbox{\scriptsize-1}\\
\ovalbox{\scriptsize1}&amp;&amp;1&amp;&amp;-3&amp;&amp;-3&amp;&amp;3&amp;&amp;3&amp;&amp;-1&amp;&amp;\ovalbox{\scriptsize-1}\\
\udots&amp;&amp;\udots&amp;&amp;\udots&amp;&amp;\udots&amp;&amp;\ddots&amp;&amp;\ddots&amp;&amp;\ddots&amp;&amp;\ddots\\ \\
&amp;&amp;&amp;&amp;&amp;&amp;&amp;i=3
}
\end{array}$
\end{table}
\end{center}

\begin{theorem}[Pascal recurrence]\label{Theorem6}
For each fixed value of $i$, the  numbers $\sigma_{i,j}^{k}$ satisfy the following  linear recurrence relation
\begin{equation}\label{rr}
\sigma_{i,j+1}^{(k+1)}=\sigma_{i,j}^{k}+\sigma_{i,j+1}^{k},\ (0\le j\le k-1, k\ge i)
\end{equation}
with boundary conditions
\begin{equation}\label{bc}
\sigma_{i,0}^{k}=1,\qquad \sigma_{i,k}^{k}=(-1)^i,\ (k\ge i) 
\end{equation}
and initial values
\begin{equation}\label{iv}
 \sigma_{i,j}^{(i)}={i\choose j}(-1)^j,\ j=1,\dots, i-1.
\end{equation}
\end{theorem}
\begin{proof}
When  $k\ge i$ and $0\le j\le k-1$ we immediately obtain from the definition of $\sigma_{i,j}^{k}$ that (cf.\ \eqref{sigma})
\begin{equation*}
\sigma_{i,j}^{k}+\sigma_{i,j+1}^{k}=\sum_{m=0}^i (-1)^{i-m}\tbinom{i}{m}\left(\tbinom{k-i}{j-m}+\tbinom{k-i}{j+1-m}\right)=\sum_{m=0}^i(-1)^{i-m}\tbinom{i}{m}\tbinom{k-i+1}{j+1-m}=\sigma_{i,j+1}^{(k+1)}.
\end{equation*}
When $j=0$ the sum in the right-hand side of \eqref{sigma} reduces to the case {$m=0$} whereas when $j=k$ the corresponding sum reduces to the case {$m=i$}. Therefore
\begin{equation*}
\sigma_{i,0}^{k}=1\qquad \text{and}\qquad \sigma_{i,k}^{k}=(-1)^i.
\end{equation*}
On the other hand, if $k=i$ the same sum only has the term corresponding to {$m=j$}. Hence
\begin{equation*}
\sigma_{i,j}^{(i)}={i\choose j}(-1)^j,\ j=0,\dots,i.
\end{equation*}
\end{proof}

Theorem~\ref{Theorem6} supports the idea that the above recurrence relation together with the boundary conditions \eqref{bc} and initial conditions \eqref{iv} lead, for each $i$,  to a  Pascal  trapezoid which can be seen as a substructure of the triangle array $\sigma_{i,j}^{k}$. In Table~\ref{table:5}, we  can  observe the  trapezoids corresponding to the  particular cases of $i=1$, $i=2$, and $i=3$ as well as the boundary and initial conditions. These trapezoids are related to the sequences \seqnum{A037012}, \seqnum{A182533}, and \seqnum{A230206}. 

In the context of this paper, we use the designation of {\sl Pascal trapezoid of order $i=1,2,\dots$} to refer to the trapezoidal array whose entries are $\sigma_{i,j}^{k}$, $k\ge i,0\le j\le k$. The following properties can easily be derived.
\begin{property}\label{Property1}
$ $
\begin{enumerate}
\item[\rm (i)]  Pascal trapezoids of even order are symmetric, i.e., $\sigma_{2i,j}^k=\sigma_{2i,k-j}^k;$
	
\item[\rm (ii)]  Pascal trapezoids of odd order are anti-symmetric, i.e., $\sigma_{2i+1,j}^k=-\sigma_{2i+1,k-j}^k$;
	
\item[\rm (iii)] The Hockey-stick identity is valid, i.e., $\sum_{r=j}^k \sigma_{i,j}^{r}=\sigma_{i,j+1}^{k+1}$.
\end{enumerate}

\begin{proof}
From \eqref{sigma} we have
\begin{equation*}
\sigma_{i,k-j}^{k}= \sum_{m=0}^i (-1)^{m}\tbinom{i}{m}\tbinom{k-i}{k-j-m}
=\sum_{m=0}^i (-1)^{m}\tbinom{i}{m}\tbinom{k-i}{j+m-i}
=\sum_{m=0}^i (-1)^{i-m}\tbinom{i}{m}\tbinom{k-i}{j-m}
=(-1)^i\sigma_{i,j}^k
\end{equation*}
and (i) and (ii) are proved. According to (\ref{rr})-(\ref{bc}),
\begin{align*}
\sum_{r=j}^{k} \sigma_{i,j}^{r}&amp;=\sigma_{i,j}^{(j)}+\sum_{r=j+1}^{k} \sigma_{i,j}^{r}
=(-1)^i+\sum_{r=j+1}^{k} (\sigma_{i,j+1}^{(r+1)}-\sigma_{i,j+1}^{r})\\
&amp;=\sum_{r=j+1}^{k} \sigma_{i,j+1}^{(r+1)}-\sum_{r=j+1}^{k-1}\sigma_{i,j+1}^{(r+1)}=\sigma_{i,j+1}^{k+1},
\end{align*}
and the proof of (iii) is complete.
\end{proof}

\end{property}

\begin{property}\label{Property2}
The central coefficients of the Pascal trapezoid of order $i$ are linked to the central binomial coefficients in the following way:
\begin{equation*}
\sigma_{i,k}^{2k}=
\begin{cases}
0,&amp;\text{if } i \text{ is odd;}\\
\displaystyle(-1)^r\frac{{k\choose r}}{{2k\choose 2r}}{2k\choose k},&amp;\text{if } i=2r \text{ is even.}\\
\end{cases}
\end{equation*}
\end{property}

\begin{proof}
Observe that
\begin{equation*}
\sigma_{i,k}^{2k}=\sum_{m=0}^i (-1)^{m}{i\choose m}{2k-i\choose k-m}=\frac{{2k\choose k}}{{2k\choose i}}\sum_{m=0}^i (-1)^{m}{k\choose m}{k\choose i-m}
\end{equation*}
and the result follows by using the identity  \cite[Formula (1.19)]{Gould}
\begin{equation*}
\sum_{m=0}^i (-1)^{m}{k\choose m}{k\choose i-m}=
\begin{cases}
0,&amp; \text {if } i \text{ is odd;}\\
(-1)^{\frac{i}2}\displaystyle{k\choose\frac{i}2},&amp; \text{if } i \text{ is even.}
\end{cases}
\end{equation*}
It is worth noting that the odd case also follows from Theorem~\ref{Theorem3}.
\end{proof}

Observe that $\sigma_{i,j}^{k}$ can also be written as (cf.\ \eqref{sigma})
 \begin{equation*}
\sigma_{i,j}^{\,k}=  \sum_{m=0}^j (-1)^{m}{i\choose m}{k-i\choose j-m},
\end{equation*}
since ${k-i\choose j-m}=0$, for $m&gt;j$, whereas ${i\choose m}=0$, for $m&gt;i$.
This leads to the conclusion that the entries of the Pascal trapezoid of order $i$
are nothing else than the coefficients in the expansion of $(1-x)^i(1+x)^{k-i}$, i.e.,
\begin{equation}\label{expansion}
(1-x)^i(1+x)^{k-i}=\sum_{j=0}^k\sigma_{i,j}^{\,k}x^j
\end{equation} 
which means that the family of Pascal trapezoids also contains as particular cases the sequences \seqnum{A230207} up to \seqnum{A230212}. Moreover, one can deduce the following properties.


\begin{property}\label{Property3}
$ $
\begin{enumerate}
\item[\rm (i)] Sum of the rows: $\sum_{j=0}^k \sigma_{i,j}^{k}=0$,  for $k\ge i&gt;0$;
\item[\rm (ii)] Alternating sum of the rows: $ \sum_{j=0}^k (-1)^j \sigma_{i,j}^{k}=0$, for $k&gt; i$;
\item[\rm (iii)] Chu-Vandermonde identity: $\sum_{m=0}^j \sigma_{i,m}^{k_1}\sigma_{i,j-m}^{k_2}=\sigma_{2i,j}^{k_1+k_2}$;
\item[\rm (iv)] Sum of the squares of the rows: $\sum_{j=0}^k (\sigma_{i,j}^{k})^2=(-1)^i\sigma_{2i,k}^{2k}$.
\end{enumerate}
\end{property}
\begin{proof}
The first two properties follow at once by considering $x=1$ and $x=-1$ in \eqref{expansion}. The Chu-Vandermonde formula follows by noting that 
$$\big((1-x)^i(1+x)^{k_1-i}\big)\big((1-x)^i(1+x)^{k_2-i}\big)=(1-x)^{2i}(1+x)^{k_1+k_2-2i}$$ 
and equating the coefficients in
$$\big(\sum_{j=0}^{k_1}\sigma_{i,j}^{\,k_1}x^j\big)\big(\sum_{j=0}^{k_2}\sigma_{i,j}^{\,k_2}x^j\big)=\sum_{j=0}^{k_1+k_2} \sigma_{2i,j}^{k_1+k_2}x^{j}.$$
Property (iv) follows from (iii) and using Property~\ref{Property1} (i) or (ii).
\end{proof}


\section{Acknowledgments}

The work of the third author was supported by Portuguese funds through
the CMAT --- Centre of Mathematics and FCT within the Project
UID/MAT/00013/2013. The work of the other  authors was supported by
Portuguese funds through the CIDMA --- Center for Research and
Development in Mathematics and Applications, and the Portuguese
Foundation for Science and Technology (``FCT-Funda\c c\~ao para a
Ci\^encia e Tecnologia"), within project PEst-OE/MAT/UI4106/2013.


\begin{thebibliography}{1}
\bibitem{AcetoMalonekTomaz2017}
L.~Aceto, H.~R.~Malonek, and G.~Tomaz,
\newblock Matrix approach to hypercomplex Appell polynomials,
\newblock {\em Appl.\ Numer.\ Math.} \textbf{116} (2017), 2--9.

\bibitem{BockGurlebeck2010}
S.~Bock and K.~G\"{u}rlebeck,
\newblock On a generalized Appell system and monogenic power series,
\newblock {\em Math. Methods Appl.\ Sci.} \textbf{33} (2010), 394--411.

\bibitem{CacaoMalonek2008}
I.~Ca{\c{c}}{\~a}o and H.~R.~Malonek,
\newblock On complete sets of hypercomplex Appell polynomials, 
\newblock in {\em Numerical Analysis and Applied Mathematics: ICNAAM 2008},
 AIP Conference Proceedings, Vol. 1048, 2008, pp.~647--650.

\bibitem{CacaoFalcaoMalonek2011}
I.~Ca{\c{c}}{\~a}o, M.~I.~Falc{\~a}o, and H.~R.~Malonek,
\newblock Laguerre derivative and monogenic Laguerre polynomials: An operational approach,
\newblock {\em Math.\ Comput.\ Model.} \textbf{53} (2011), 1084--1094.

\bibitem{CacaoMalonek2011a}
I.~Ca{\c{c}}{\~a}o and H.~R.~Malonek,
\newblock On a hypercomplex generalization of Gould-Hopper and related Chebyshev polynomials, 
\newblock in {\em Computational Science and its Applications: ICCSA 2011},
Lect.\ Notes in Comp.\ Sci., Vol. 6784, Springer, 2011, pp.~316--326. 

\bibitem{CacaoFalcaoMalonek2012}
I.~Ca{\c{c}}{\~a}o, M.~I.~Falc{\~a}o, and H.~R.~Malonek,
\newblock Matrix representations of a special polynomial sequence in arbitrary dimension,
\newblock {\em Comput.\ Methods Funct.\ Theory} \textbf{12} (2012), 371--391.

\bibitem{CacaoFalcaoMalonek2017}
I.~Ca{\c{c}}{\~a}o, M.~I.~Falc{\~a}o, and H.~R.~Malonek,
\newblock Three-term recurrence relations for systems of Clifford
algebra-valued orthogonal polynomials,
\newblock {\em Adv.\  Appl.\ Clifford Algebr.} \textbf{27} (2017), 71--85.

\bibitem{CacaoFalcaoMalonek2017a}
I.~Ca{\c{c}}{\~a}o, M.~I.~Falc{\~a}o, and H.~R.~Malonek,
\newblock Hypercomplex polynomials, Vietoris' rational numbers and a related integer numbers sequence,
\newblock {\em Complex Anal.\ Oper.\ Theory} \textbf{11} (2017), 1059--1076.

\bibitem{CruzFalcaoMalonek2011}
C.~Cruz, M.~I.~Falc{\~a}o, and H.~R.~Malonek,
\newblock 3D mappings by generalized Joukowski transformations, 
\newblock in {\em Computational Science and its Applications: ICCSA 2011},
Lect. Notes in Comp.\ Sci., Vol. 6784, Springer, 2011, pp.~358--373. 

\bibitem{CruzFalcaoMalonek2014}
C.~Cruz, M.~I.~Falc{\~a}o, and H.~R.~Malonek,
\newblock Monogenic pseudo-complex power functions and their applications,
\newblock {\em Math.\ Methods Appl.\ Sci.} \textbf{37} (2014), 1723--1735.

\bibitem{Eelbode2012}
D.~Eelbode,
\newblock Monogenic Appell sets as representations of Heisenberg algebra,
\newblock {\em Adv.\ Appl.\ Clifford Algebr.} \textbf{22} (2012), 1009--1023.

\bibitem{FalcaoCruzMalonek2006}
M.~I.~Falc{\~a}o, J.~Cruz, and H.~R.~Malonek,
\newblock Remarks on the generation of monogenic functions, 
\newblock in {\em 17th Inter. Conf. on the Appl. of Computer Science and Mathematics on
Architecture and Civil Engineering}, Weimar, Germany, 2006, \url{https://e-pub.uni-weimar.de/opus4/files/2939/f81_pdfa.pdf}

\bibitem{FalcaoMalonek2007}
M.~I.~Falc{\~a}o and H.~R.~Malonek,
\newblock Generalized exponentials through Appell sets in $\R^{n+1}$ and Bessel functions, 
\newblock in {\em Numerical Analysis and Applied Mathematics: ICNAAM 2007},
 AIP Conference Proceedings, Vol. 936, 2007, pp.~738--741.

\bibitem{FalcaoMalonek2012b}
M.~I. Falc{\~a}o and H.~R. Malonek,
\newblock A note on a one-parameter family of non-symmetric number triangles,
\newblock {\em Opuscula Math.} \textbf{32} (2012), 661--673.

\bibitem{Gould}
H.~G. Gould,
\newblock Combinatorial Identities: Table I: Intermediate Techniques for
Summing Finite Series, \url {http://www.math.wvu.edu/~gould/Vol.4.PDF}.


\bibitem{GuerlebeckMalonek1999}
 K.~G\"{u}rlebeck and  H.~R. Malonek,
\newblock  A hypercomplex derivative of monogenic functions in $\R^{m+1}$ and its applications,
\newblock {\em Complex Variables} \textbf{39} (1999), 199--228.

\bibitem{Guerlebeck2009}
 N.~G\"{u}rlebeck,
\newblock  On Appell sets and the Fueter-Sce mapping,
\newblock {\em Adv.\ Appl.\ Clifford Algebr.} \textbf{19} (1999),  51--61. 

\bibitem{Lavicka2010}
 R.~L\'avi\v{c}ka,
\newblock  Canonical bases for $\mathfrak{sl}(2,{\mathbb{C}})$-modules of spherical monogenics in dimension 3,
\newblock {\em Arch.\ Math.} \textbf{46} (2010), 339--349.  

\bibitem{Lavicka2012}
 R.~L\'avi\v{c}ka,
\newblock  Complete orthogonal Appell systems for spherical monogenics,
\newblock {\em Complex Anal.\ Oper.\ Theory} \textbf{6} (2012), 477--480.  

\bibitem{Malonek2004}
H.~R.~Malonek,
\newblock Selected topics in hypercomplex function theory,
\newblock in S.-L. Eriksson, ed., {\em Clifford Algebras and Potential Theory}, Vol. 7, 2004, pp.~111--150.
	
\bibitem{MalonekFalcao2007}
H.~R.~Malonek and M.~I.~Falc{\~a}o,
\newblock Special monogenic polynomials - properties and applications,
\newblock in  {\em Numerical Analysis and Applied Mathematics: ICNAAM 2007},
AIP Conference Proceedings, Vol. 936, 2007, pp.~764--767.
	
\bibitem{MalonekFalcao2010}
H.~R.~Malonek and M.~I.~Falc{\~a}o,
\newblock On special functions in the context of Clifford analysis, 
\newblock in {\em Numerical Analysis and Applied Mathematics: ICNAAM 2010},
 AIP Conference Proceedings, Vol. 1281, 2010, pp.~1492--1495.

\bibitem{MalonekFalcao2011}
H.~R.~Malonek and M.~I.~Falc{\~a}o,
\newblock Linking Clifford analysis and combinatorics through  bijective methods,
\newblock in {\em 9th Inter.\ Conf.\ on Clifford Algebras and their Applications in Mathematical Physics}, Weimar, Germany, 2011.
	
\bibitem{MianaOhtsukaRomero2017}
P.~J.~Miana, H.~Ohtsuka, and N.~Romero,
\newblock Sums of powers of Catalan triangle numbers,
\newblock {\em Discrete Math.} \textbf{340} (2017), 2388--2397.

\bibitem{MoraisLe2011}
J.~Morais and H.~T.~Le,
\newblock Orthogonal Appell systems of monogenic functions in the cylinder,  
\newblock {\em Math.\ Methods Appl.\ Sci.} \textbf{34} (2011), 1472--1486.

\bibitem{OEIS} N.~J.~A. Sloane, 
\newblock {\em The On-Line Encyclopedia of Integer Sequences},
\url{http://oeis.org}.

\end{thebibliography}

\bigskip
\hrule
\bigskip

\noindent 2010 {\it Mathematics Subject Classification}: Primary 05A10;
Secondary 05A19, 11B83, 30G35.

\noindent \emph{Keywords: } binomial coefficient, special sequence,
hypercomplex Appell polynomial.


\bigskip
\hrule
\bigskip

\noindent (Concerned with sequences 
\seqnum{A000165},
\seqnum{A000302},
\seqnum{A000466},
\seqnum{A001790},
\seqnum{A004736},
\seqnum{A005408},
\seqnum{A026741},
\seqnum{A037012},
\seqnum{A046161},
\seqnum{A078817},
\seqnum{A098597},
\seqnum{A099398},
\seqnum{A099399},
\seqnum{A120777},
\seqnum{A162540},
\seqnum{A182533},
\seqnum{A230206},
\seqnum{A230207},
\seqnum{A230208},
\seqnum{A230209},
\seqnum{A230210},
\seqnum{A230211},
\seqnum{A230212}, and
\seqnum{A283208}.)


\bigskip
\hrule
\bigskip

\vspace*{+.1in}
\noindent
Received  July 21 2018;
revised version received  August 6 2018.
Published in {\it Journal of Integer Sequences},
August 23 2018.

\bigskip
\hrule
\bigskip

\noindent
Return to
\htmladdnormallink{Journal of Integer Sequences home page}{http://www.cs.uwaterloo.ca/journals/JIS/}.
\vskip .1in


\end{document}

                                                                                




</pre></body></html>