<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}{-.5in}
\setlength{\textheight}{8.9in}

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

\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}

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

\begin{center}
\vskip 1cm{\LARGE\bf Families of Sequences From a \\ 
\vskip 0.3cm
Class of Multinomial Sums
}
\vskip 1cm
\large
Martin Griffiths\\
Department of Mathematical Sciences\\
University of Essex\\
Colchester\\
CO4 3SQ\\
United Kingdom\\
\href{mailto:griffm@essex.ac.uk}{\tt griffm@essex.ac.uk}\\
\end{center}

\vskip .2 in

\begin{abstract}
In this paper we obtain formulas for certain sums of products involving
multinomial coefficients and Fibonacci numbers.  The sums studied here
may be regarded as generalizations of the binomial transform of the
sequence comprising the even-numbered terms of the Fibonacci sequence.
The general formulas, involving both Fibonacci and Lucas numbers, give
rise to infinite sequences that are parameterized by two positive
integers.  Links to the exponential partial Bell polynomials are also
established.
\end{abstract}

\section{Introduction}
The sequences being considered in much of what follows may in some sense be regarded as generalizations of the \textit{binomial transform} $\left\{b_n\right\}$ of $\left\{F_{2n}\right\}$, where the $n$th \textit{Fibonacci number} $F_n$ may be defined recursively by setting $F_0=0$, $F_1=1$, and $F_n=F_{n-1}+F_{n-2}$ for $n\geq 2$ \cite{burton,cameron,knott}.  The $n$th term of $\left\{b_n\right\}$ is given by
\begin{equation}\label{bintransform}
b_n=\sum_{k=0}^n{n \choose k}F_{2k}.
\end{equation}
This sequence, which starts $1,5,20,75,275,\ldots$, appears in Sloane's \textit{On-line Encyclopedia of Integer Sequences} \cite{sloane} as \seqnum{A093131}.  It may be shown that
\begin{equation}\label{bintransformres}
b_{2n-1}=5^{n-1}L_{2n-1}\qquad\textup{and}\qquad b_{2n}=5^n F_{2n},
\end{equation}
where $L_n$, the $n$th \textit{Lucas number}, is defined by  $L_0=2$, $L_1=1$ and $L_n=L_{n-1}+L_{n-2}$ for $n\geq 2$.

 Our generalization leads us to study certain sums of products involving multinomial coefficients and Fibonacci numbers.  These give rise to sequences parameterized by two positive integers, $s$ and $t$.  In other words, each pair $(s,t)$ is associated with a particular infinite sequence.  Note, by way of contrast, that $\left\{b_n\right\}$ does not possess any parameters.  A further result concerning 1-parameter sequences is then derived.  Finally, we go on to obtain some results associated with our sequences, including one in connection with the exponential partial Bell polynomials.

\section{Some general results}\label{section2}
Throughout this paper we use the notation
\[{n \choose a_0,a_2,\ldots,a_{t-1}}\]
to represent the \textit{multinomial coefficient} \cite{knuth}
\[\frac{\left(a_0+a_2+\cdots+a_{t-1}\right)!}{a_0!a_1!\cdots a_{t-1}!},\]
where each $a_i$, $i=0,1,\ldots,t-1$, is a non-negative integer such that $n=a_0+a_1+\cdots+a_{t-1}$.  The binomial coefficients correspond to the special case $t=2$.

Furthermore, we shall find it useful to extend the definition of the Fibonacci numbers to negative subscripts as in \cite{knott}.  This may be achieved by rearranging the Fibonacci recurrence relation to give $F_{n-2}=F_n-F_{n-1}$ and then using it in a recursive manner for $n=1,0,-1,-2\ldots$.  From this we obtain $F_{-1}=F_1-F_0=1$, $F_{-2}=F_0-F_{-1}=-1$, and so on.  It is in fact straightforward to show that for any $n\in\mathbb{N}$,
\begin{equation}\label{fibnegsub}
F_{-n}=(-1)^{n+1}F_n.
\end{equation}

In order to obtain some of the results that follow, we will, at appropriate points, introduce and utilize various mathematical properties of the \textit{golden ratio} $\phi$ \cite{hardy,knott,knuth}, where
\[\phi=\frac{1+\sqrt{5}}{2}.\]
We shall have cause to make frequent use of the result
\begin{equation}\label{phipower}
\phi^j=F_j\phi+F_{j-1},
\end{equation}
which is given in \cite{knott,knuth}.  This may be proved by induction using the Fibonacci recurrence relation and the fact that $\phi^2=\phi+1$.  Note, by virtue of (\ref{fibnegsub}) and the result $\frac{1}{\phi}=\phi-1$, that (\ref{phipower}) is valid for all $j\in\mathbb{Z}$.  Similarly, we may obtain

\begin{equation}
\label{lucasnegsub}
L_{-n}=(-1)^{n}L_n
\end{equation}
and
\begin{equation}
\label{lucasphi}
\sqrt{5}\,\,\phi^j=L_j\phi+L_{j-1}.
\end{equation}
Result (\ref{lucasphi}) appears in \cite{knott} and, as with
(\ref{phipower}), is valid for all $j\in\mathbb{Z}$. 

In Theorem \ref{gentheorem} below, use shall be made of the following simple Lemma concerning irrational numbers in general:
\begin{lemma}\label{irratlemma}
For any irrational number $\alpha$ and $p,q,r,s\in\mathbb{Q}$, $p\alpha+r=q\alpha+s$ if, and only if, $p=q$ and $r=s$.
\end{lemma}

\begin{proof}
Suppose that $p\alpha+r=q\alpha+s$.  If $p=q$ then it is clear that $r=s$.  Let us assume, therefore, that $p\neq q$.  We then can write
\[\alpha=\frac{s-r}{p-q}\in\mathbb{Q}.\]
This, however, is a contradiction since $\alpha$ is irrational.  It must thus be the case that $p\alpha+r=q\alpha+s$ implies $p=q$ and $r=s$.  The converse is obviously true, thereby proving the lemma.
\end{proof}

\begin{theorem}\label{gentheorem}
\[\sum{n \choose a_0,a_1,\ldots,a_{2m-1}}F_{u_1(k,m)}=F_{2kn(2m-1)}\left(\frac{F_{4km}}{F_{2k}}\right)^n,\]
where
\[u_1(k,m)=4k\left(a_1+2a_2+\cdots+(2m-1)a_{2m-1}\right)\]
and the summation is to be taken over all possible $a_i\geq 0$, $i=0,1,2,\ldots,2m-1$, such that $a_0+a_1+\cdots+a_{2m-1}=n$.
\end{theorem}

\begin{proof}
First, let
\begin{align*}
g(s,t)
&amp;=1+\phi^{2s}+\phi^{4s}+\cdots+\phi^{2s(t-1)}\nonumber\\
&amp;=\sum_{j=0}^{t-1}\phi^{2js},
\end{align*}
where $s,t\in\mathbb{N}$ such that $t\geq 2$.  Then, on using (\ref{phipower}), it follows that for any $n\in\mathbb{N}$ we have
\begin{align}
[g(2k,2m)]^n
&amp;=\sum{n \choose a_0,a_1,\ldots,a_{2m-1}}\left(\phi^{4k}\right)^{a_1}\left(\phi^{8k}\right)^{a_2}\cdots
\left(\phi^{4k(2m-1)}\right)^{a_{2m-1}}\nonumber\\
&amp;=\sum{n \choose a_0,a_1,\ldots,a_{2m-1}}\phi^{4k\left(a_1+2a_2+\cdots+(2m-1)a_{2m-1}\right)}\label{phimult1}\\
&amp;=\sum{n \choose a_0,a_1,\ldots,a_{2m-1}}\left(F_{u_1(k,m)}\phi+F_{u_1(k,m)-1}\right)\label{phimult2},
\end{align}
where $u_1(k,m)$ is as in the statement of the theorem, and the summation is to be taken over all possible $a_i\geq 0$, $i=0,1,2,\ldots,2m-1$, such that $a_0+a_1+\cdots+a_{2m-1}=n$.

Next, on using the formula for the sum of a finite geometric progression \cite{sadler}, we have
\begin{align}\label{ggp}
g(s,t)
&amp;=\frac{\left(\phi^{2s}\right)^t-1}{\phi^{2s}-1}\nonumber\\
&amp;=\frac{\phi^{st}\left(\phi^{st}-\phi^{-st}\right)}{\phi^{s}\left(\phi^{s}-\phi^{-s}\right)}\nonumber\\
&amp;=\phi^{s(t-1)}\left(\frac{\phi^{st}-\phi^{-st}}{\phi^{s}-\phi^{-s}}\right).
\end{align}
From Binet's formula \cite{burton,cameron,hardy,knott,knuth}
\[F_j=\frac{1}{\sqrt{5}}\left(\phi^j-\left(-\frac{1}{\phi}\right)^j\right)\]
and the corresponding formula for the Lucas numbers \cite{burton,hardy}
\[L_j=\phi^j+\left(-\frac{1}{\phi}\right)^j\]
we may obtain the result
\begin{equation}\label{fiblucasres}
\phi^{j}-\phi^{-j}=
\begin{cases}
\sqrt{5}\,F_j, &amp; \,\,\,\text{if $j$ is even};\\
L_j, &amp; \,\,\,\text{if $j$ is odd}.
\end{cases}
\end{equation}
This implies, by way of (\ref{ggp}), that
\[g(2k,2m)=\phi^{2k(2m-1)}\frac{F_{4km}}{F_{2k}},\]
and hence, using (\ref{phipower}), that
\begin{align}
[g(2k,2m)]^n
&amp;=\phi^{2kn(2m-1)}\left(\frac{F_{4km}}{F_{2k}}\right)^n\label{galt1}\\
&amp;=\left(\phi F_{2kn(2m-1)}+F_{2kn(2m-1)-1}\right)\left(\frac{F_{4km}}{F_{2k}}\right)^n\label{galt2}.
\end{align}
The theorem then follows from (\ref{phimult2}), (\ref{galt2}) and Lemma \ref{irratlemma} with $\alpha=\phi$.
\end{proof}

In the following corollary we show how to generalize the result from Theorem \ref{gentheorem} yet further:

\begin{corollary}\label{corollextend} For any $j\in\mathbb{Z}$,
\[\sum{n \choose a_0,a_1,\ldots,a_{2m-1}}F_{u_1(k,m)+j}=F_{2kn(2m-1)+j}\left(\frac{F_{4km}}{F_{2k}}\right)^n,\]
where the notation is identical to that used in the statement of Theorem \ref{gentheorem}.
\end{corollary}

\begin{proof}
From (\ref{phimult1}) and (\ref{galt1}), we obtain
\[\sum{n \choose a_0,a_1,\ldots,a_{2m-1}}\phi^{4k\left(a_1+2a_2+\cdots+(2m-1)a_{2m-1}\right)}=\phi^{2kn(2m-1)}\left(\frac{F_{4km}}{F_{2k}}\right)^n.\]
Both sides of this equality are then multiplied by $\phi^j$ for some $j\in\mathbb{Z}$, and the result follows from (\ref{phipower}) and Lemma \ref{irratlemma}.
\end{proof}

Similarly, (\ref{ggp}) and (\ref{fiblucasres}) give
\begin{align}
g(2k-1,2m)&amp;=\phi^{(2k-1)(2m-1)}\frac{\sqrt{5}\,F_{2m(2k-1)}}{L_{2k-1}}\label{fourexp2},\\
g(2k,2m-1)&amp;=\phi^{4k(m-1)}\frac{F_{2k(2m-1)}}{F_{2k}}\label{fourexp3},\\
g(2k-1,2m-1)&amp;=\phi^{2(2k-1)(m-1)}\frac{L_{(2k-1)(2m-1)}}{L_{2k-1}}\label{fourexp4}.
\end{align}
On obtaining the multinomial expansions for $[g(2k,2m-1)]^n$ and $[g(2k-1,2m-1)]^n$, using (\ref{fourexp3}) and (\ref{fourexp4}), and then employing a similar idea to that utilized in Corollary \ref{corollextend}, we have the following results:
\begin{equation}\label{resu3}
\sum{n \choose a_0,a_1,\ldots,a_{2m-2}}F_{u_3(k,m)+j}=F_{4kn(m-1)+j}\left(\frac{F_{2k(2m-1)}}{F_{2k}}\right)^n
\end{equation}
and
\begin{equation}\label{resu4}
\sum{n \choose a_0,a_1,\ldots,a_{2m-2}}F_{u_4(k,m)+j}=F_{2n(2k-1)(m-1)+j}\left(\frac{L_{(2k-1)(2m-1)}}{L_{2k-1}}\right)^n,
\end{equation}
where
\[u_3(k,m)=4k\left(a_1+2a_2+\cdots+(2m-2)a_{2m-2}\right)\]
and
\[u_4(k,m)=2(2k-1)\left(a_1+2a_2+\cdots+(2m-2)a_{2m-2}\right).\]

The presence of the factor $\sqrt{5}$ in (\ref{fourexp2}) means that, in order to use Lemma \ref{irratlemma}, a slightly different treatment is required.  We use (\ref{phipower}) and (\ref{lucasphi}) to obtain
\begin{align*}
[g(2k-1,2m)]^{2n-1}
&amp;=5^{n-1}\sqrt{5}\,\phi^{(2n-1)(2k-1)(2m-1)}\left(\frac{F_{2m(2k-1)}}{L_{2k-1}}\right)^{2n-1}\\
&amp;=5^{n-1}\left(L_{(2n-1)(2k-1)(2m-1)}\phi+L_{(2n-1)(2k-1)(2m-1)}\right)\left(\frac{F_{2m(2k-1)}}{L_{2k-1}}\right)^{2n-1}
\end{align*}
and
\begin{align*}
[g(2k-1,2m)]^{2n}
&amp;=5^n\phi^{2n(2k-1)(2m-1)}\left(\frac{F_{2m(2k-1)}}{L_{2k-1}}\right)^{2n}\\
&amp;=5^n\left(F_{2n(2k-1)(2m-1)}\phi+F_{2n(2k-1)(2m-1)}\right)\left(\frac{F_{2m(2k-1)}}{L_{2k-1}}\right)^{2n}.
\end{align*}
These results lead to
\begin{equation}\label{gentransform1}
\sum{2n-1 \choose a_0,a_1,\ldots,a_{2m-1}}F_{u_2(k,m)+j}=5^{n-1}L_{(2n-1)(2k-1)(2m-1)+j}\left(\frac{F_{2m(2k-1)}}{L_{2k-1}}\right)^{2n-1}
\end{equation}
and
\begin{equation}\label{gentransform2}
\sum{2n \choose a_0,a_1,\ldots,a_{2m-1}}F_{u_2(k,m)+j}=5^nF_{2n(2k-1)(2m-1)+j}\left(\frac{F_{2m(2k-1)}}{L_{2k-1}}\right)^{2n},
\end{equation}
respectively, where
\[u_2(k,m)=2(2k-1)\left(a_1+2a_2+\cdots+(2m-1)a_{2m-1}\right).\]

Note that a formula for the right-hand side of (\ref{bintransform}) may be obtained by considering the expansion of $\left(1+\phi^{2}\right)^n=[g(1,2)]^n$.  The results $b_{2n-1}=5^{n-1}L_{2n-1}$ and $b_{2n}=5^n F_{2n}$ given in (\ref{bintransformres}) may thus be seen to be specializations of (\ref{gentransform1}) and (\ref{gentransform2}), respectively.  It is also worth noting, for example, that both Identity 3 in \cite{benjamin} and Result (31) in \cite{layman} are specializations of Theorem \ref{gentheorem}.  The sequence arising from Identity 3 in \cite{benjamin} appears in \cite{sloane} as \seqnum{A087426}.

Since
\[\sum{n \choose a_0,a_1,\ldots,a_{2m-1}}F_{u_1(k,m)}\]
is an integer, it follows from Theorem \ref{gentheorem} that
\[F_{2k}^n|F_{2kn(2m-1)}F_{4km}^n.\]
Although not necessarily following from this divisibility result, it is in fact well-known that $F_{a}|F_{ab}$ and hence $F_{a}^n|F_{ab}^n$ for any $a,b,n\in \mathbb{N}$ \cite{burton}.  Indeed, a similar observation may be made regarding (\ref{resu3}). On considering (\ref{resu4}) we see that
\[L_{2k-1}^n|F_{2n(2k-1)(m-1)}L_{(2k-1)(2m-1)}^n.\]
Again, although not necessarily following from this, it is true, if rather less well-known, that $L_a|L_{ab}$ for any odd positive integers $a$ and $b$.  Similarly, (\ref{gentransform1}) and (\ref{gentransform2}) hint at the possibility that, for any odd positive integer $a$ and even positive integer $b$,  $L_a|F_{ab}$.  This result also happens to be true (see \cite{knott} for a summary of such results).

Leading on from this, since
\[\frac{F_{2k(2m-1)}}{F_{2k}}=1+\sum_{j=1}^{m-1}L_{4jk}\qquad\textup{and}\qquad
\frac{L_{(2k-1)(2m-1)}}{L_{2k-1}}=1+\sum_{j=1}^{m-1}L_{2j(2k-1)},\]
we may in fact combine (\ref{resu3}) and (\ref{resu4}) to give
\[\sum{n \choose a_0,a_1,\ldots,a_{2m-2}}F_{u_5(s,m)+j}=F_{2sn(m-1)+j}\left(1+\sum_{j=1}^{m-1}L_{2js}\right)^n,\]
where
\[u_5(s,m)=2s\left(a_1+2a_2+\cdots+(2m-2)a_{2m-2}\right)\]
We have thus combined two cases at the expense of a somewhat more unwieldy expression on the right-hand side.

\section{An alternative family of sequences}
We now consider a family of sequences parameterized by $t\in\mathbb{N}$ such that $t$ is even, noting that these are not specializations of any of the sequences derived in Section \ref{section2}.  Let us start by defining the expression $h(t)$ given by
\[h(t)=1+\phi+\phi^2+\cdots+\phi^{(t-1)}.\]
Then, since $\phi=\frac{1}{\phi-1}$, we may obtain
\begin{align}\label{interres1}
h(4m)
&amp;=\frac{\phi^{4m}-1}{\phi-1}\nonumber\\
&amp;=\phi\cdot\phi^{2m}\left(\phi^{2m}-\phi^{-2m}\right)\nonumber\\
&amp;=\phi^{2m+1}\left(\phi^{2m}-\left(-\frac{1}{\phi}\right)^{2m}\right)\nonumber\\
&amp;=\phi^{2m+1}\sqrt{5}\,F_{2m},
\end{align}
and similarly
\begin{align}\label{interres2}
h(4m-2)
&amp;=\phi^{2m}\left(\phi^{2m-1}+\left(-\frac{1}{\phi}\right)^{2m-1}\right)\nonumber\\
&amp;=\phi^{2m}L_{2m-1}.
\end{align}
Result (\ref{interres1}) gives rise to
\[\sum{2n-1 \choose a_0,a_1,\ldots,a_{4m-1}}F_{v_1(m)+j}=5^{n-1}L_{(2n-1)(2m+1)+j}F_{2m}^{2n-1}\]
and
\[\sum{2n \choose a_0,a_1,\ldots,a_{4m-1}}F_{v_1(m)+j}=5^nF_{2n(2m+1)+j}F_{2m}^{2n},\]
while (\ref{interres2}) leads to
\begin{equation}\label{simplecase}
\sum{n \choose a_0,a_1,\ldots,a_{4m-3}}F_{v_2(m)+j}=F_{2mn+j}L_{2m-1}^n,
\end{equation}
where
\[v_1(m)=a_1+2a_2+\cdots+(4m-1)a_{4m-1}\]
and
\[v_2(m)=a_1+2a_2+\cdots+(4m-3)a_{4m-3}.\]

\section{Further results}
As we now show, it is possible to express (\ref{simplecase}) in a form such that the subscripts of the Fibonacci numbers are given explicitly.  On treating $\left(1+x+x^2+\cdots+x^{t-1}\right)^n$ as a formal power series and ignoring issues of convergence, we have
\begin{align*}
\left(1+x+x^2+\cdots+x^{t-1}\right)^n
&amp;=\left(\frac{1-x^t}{1-x}\right)^n\\
&amp;=\left(1-x^t\right)^n(1-x)^{-n}\\
&amp;=\sum_{i=0}^n{n \choose i}\left(-x^t\right)^i\sum_{j=0}^{\infty}{n-1+j \choose n-1}x^j.
\end{align*}
Our aim is to find the coefficient of $x^r$ in the above product of sums.  To this end, consider the following typical term that arises when the product is expanded:
\[(-1)^i{n \choose i}{n-1+j \choose n-1}x^{ti+j}.\]
It is clear from this that
\[(-1)^i{n \choose i}{n-1+j \choose n-1}\]
makes a non-zero contribution to the coefficient of $x^r$ if, and only if, $0\leq i\leq \left\lfloor \frac{r}{t} \right\rfloor$.  The coefficient of $x^r$ is thus
\[\sum_{i=0}^{\left\lfloor \frac{r}{t} \right\rfloor}(-1)^i{n \choose i}{n-1+r-ti \choose n-1}.\]
In conjunction with (\ref{simplecase}) this then leads to the result
\[\sum_{r=0}^{n(4m-3)}\sum_{i=0}^{\left\lfloor \frac{r}{4m-2} \right\rfloor}(-1)^i{n \choose i}{n-1+r-i(4m-2) \choose n-1}F_{r+j}=F_{2mn+j}L_{2m-1}^n\]
for any $j\in\mathbb{Z}$.

Finally, we demonstrate a connection between the results obtained in Section \ref{section2} and the \textit{exponential partial Bell polynomials} $B_{k,n}$ \cite{mihoubi,wiki}.  The latter are defined by way of
\[\sum_{k=n}^{\infty}B_{k,n}\left(x_1,x_2,\ldots\right)\frac{t^k}{k!}
=\frac{1}{n!}\left(\sum_{j=1}^{\infty}\frac{t^j}{j!}x_j\right)^n.\]
There are a number of well-known results associated with these polynomials.  For example,
\begin{align*}
\sum_{k=n}^{\infty}B_{k,n}\left(1,1,1,\ldots\right)\frac{t^k}{k!}
&amp;=\frac{1}{n!}\left(\sum_{j=1}^{\infty}\frac{t^j}{j!}\right)^n\\
&amp;=\frac{1}{n!}\left(e^t-1\right)^n,
\end{align*}
which is the exponential generating function for the $n$th column of the Stirling number triangle of the second kind.  Incidentally, it follows from this that
\[B_{k,n}(1,1,1,\ldots)=S(k,n),\]
the Stirling number of the second kind enumerating the ways of partitioning a set of $k$ labeled objects into $n$
non-empty disjoint parts.  In addition, the $k$th Bell number $B_k$ arises by way of
\[\sum_{n=1}^k B_{k,n}(1,1,1,\ldots)=B_k.\]
This number enumerates all possible partitions of $k$ labeled objects.

We obtain here the result
\begin{equation}\label{bellres}
\sum_{k=2n-1}^{\infty}B_{k,2n-1}\left(1!,2!,\ldots,(4m)!,0,0,\ldots\right)\frac{F_{k+j}}{k!}
=\frac{5^{n-1}}{(2n-1)!}L_{2(m+1)(2n-1)+j}F_{2m}^{2n-1}
\end{equation}
for any $j\in\mathbb{Z}$, noting that the left-hand side is in fact a finite sum.  First, with the help of (\ref{fiblucasres}):
\begin{align*}
\sum_{k=2n-1}^{\infty}B_{k,2n-1}\left(1!,2!,\ldots,(4m)!,0,0,\ldots\right)\frac{\phi^k}{k!}
&amp;=\frac{1}{(2n-1)!}\left(\sum_{j=1}^{4m}\frac{\phi^j}{j!}j!\right)^{2n-1}\\
&amp;=\frac{\phi^{2n-1}}{(2n-1)!}\left(\sum_{j=0}^{4m-1}\phi^j\right)^{2n-1}\\
&amp;=\frac{\phi^{2n-1}}{(2n-1)!}\left(\frac{\phi^{4m}-1}{\phi-1}\right)^{2n-1}\\
&amp;=\frac{\phi^{4n-2}}{(2n-1)!}\left(\phi^{2m}\left(\phi^{2m}-\phi^{-2m}\right)\right)^{2n-1}\\
&amp;=\frac{\sqrt{5}\,\phi^{2(m+1)(2n-1)}}{(2n-1)!}5^{n-1} F_{2m}^{2n-1}.
\end{align*}
Then, on utilizing Lemma \ref{irratlemma}, (\ref{lucasphi}) and the idea from Corollary \ref{corollextend}, we obtain (\ref{bellres}).  Similarly,
\[\sum_{k=2n}^{\infty}B_{k,2n}\left(1!,2!,\ldots,(4m)!,0,0,\ldots\right)\frac{F_{k+j}}{k!}=\frac{5^n}{(2n)!}F_{4n(m+1)+j}F_{2m}^{2n}\]
and
\[\sum_{k=n}^{\infty}B_{k,n}\left(1!,2!,\ldots,(4m-2)!,0,0,\ldots\right)\frac{F_{k+j}}{k!}=\frac{1}{n!}F_{n(2m+1)+j}L_{2m-1}^{n}.\]

\section{Acknowledgement}
The author wishes to thank the referee for a number of comments and suggestions that have led to improvements in this paper.

\begin{thebibliography}{99}

\bibitem{benjamin}  A. T. Benjamin, A. K. Eustis, and S. S. Plott, The
99th Fibonacci identity, \textit{Electron. J. Combin.} \textbf{15}
(2008), \#R34.

\bibitem{burton} D. Burton, \textit{Elementary Number Theory},
McGraw-Hill, 1998.

\bibitem{cameron} P. J. Cameron, \textit{Combinatorics: Topics,
Techniques, Algorithms}, Cambridge University Press, 1994.

\bibitem{hardy} G. H. Hardy and E. M. Wright, \textit{An Introduction
to the Theory of Numbers}, 6th ed., Oxford University Press, 2008.

\bibitem{knott} R. Knott, Fibonacci and golden ratio formulae, \vfil
\url{http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibFormulae.html},
2011.

\bibitem{knuth} D. E. Knuth, \textit{The Art of Computer Programming}, Vol. 1, Addison-Wesley, 1968.

\bibitem{layman} J. W. Layman, Certain general binomial-Fibonacci sums,
\textit{Fibonacci Quart.} \textbf{15} (1977), 362--366.

\bibitem{mihoubi} M. Mihoubi, Partial Bell polynomials and inverse
relations, \textit{J. Integer Seq.} \textbf{13} (2010), 
\href{http://www.cs.uwaterloo.ca/journals/JIS/VOL13/Mihoubi/mihoubi8.html}{Article 10.4.5}.

\bibitem{sadler} A. J. Sadler and D. W. S. Thorning,
\textit{Understanding Pure Mathematics}, Oxford University Press,
1987.

\bibitem{sloane} N. J. A. Sloane (Ed.), The On-Line Encyclopedia of
Integer Sequences,  \url{http://oeis.org/}, 2011.

\bibitem{wiki} Wikipedia contributors, Bell polynomials,
\textit{Wikipedia, The Free Encyclopedia},
\url{http://en.wikipedia.org/wiki/Bell_polynomials}, 2011.

\end{thebibliography}

\bigskip
\hrule
\bigskip

\noindent 2010 \textit{Mathematics Subject Classification}:  Primary
11B39; Secondary 05A10.\\

\noindent \textit{Keywords}:  multinomial coefficient, Fibonacci
number, Lucas number, partial Bell polynomial.\\

\bigskip
\hrule
\bigskip

\noindent (Concerned with sequences
\seqnum{A087426} and
\seqnum{A093131}.)

\bigskip
\hrule
\bigskip

\vspace*{+.1in}
\noindent
Received October 6 2011;
revised version received December 27 2011.  
Published in {\it Journal of Integer Sequences}, December 27 2011.

\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>