<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 On Multiperiodic Infinite Recursions and \\
\vskip .1in
Their Finite Core
}
\vskip 1cm
\large
Stephan Dominique Andres\\
Department of Mathematics and Computer Science\\
Fernuniversit\"{a}t in Hagen\\
L\"{u}tzowstr.\ 125 \\
58084 Hagen \\
Germany\\
\href{mailto:dominique.andres@fernuni-hagen.de}{\tt dominique.andres@fernuni-hagen.de}\\
\end{center}

\vskip .2 in
\begin{abstract}
We define \emph{multiperiodic infinite recursions} and show that for such a 
recursion there is a finite linear recursion, the \emph{finite core}, 
which gives almost the same type of recursion except for a different 
offset. Moreover, if we add the sequences produced by all multiperiodic 
infinite recursions with a given finite core, we almost obtain a multiple 
of the sequence associated with the finite core.
\end{abstract}


\newcommand{\oo}[1]{\ensuremath{S_{\mathcal{#1}}}}
\newcommand{\oc}[1]{\ensuremath{S_{\mathcal{#1}}^{(c)}}}
\newcommand{\oon}[1]{\ensuremath{S_{#1}}}
\newcommand{\ocn}[1]{\ensuremath{S_{#1}^{(c)}}}
\newcommand{\Z}{\ensuremath{\mathbb Z}}
\newcommand{\N}{\ensuremath{\mathbb N}}
\newcommand{\Phic}{\ensuremath{\Phi^{(c)}}}
\renewcommand{\leer}[1]{\ensuremath{\oon{\emptyset}({#1})}}
\newcommand{\addi}[3]{\ensuremath{\bigoplus_{{#1}=1}^{#2}\sum_{\substack{0#3}}^{\infty}}}
\newcommand{\M}{\ensuremath{\mathcal{M}}}
\newcommand{\PP}{\ensuremath{\mathcal{P}}}




\section{Introduction}

Consider the problem to determine the number of all additive partitions of 
an integer $n$ into terms from a (possibly infinite) set $M$ of positive 
integers, where we 
consider two partitions as different even if they contain the same terms 
but in a different order. We denote this number as $\oon{M}(n)$.
Obviously, there is a recursive method to calculate $\oon{M}(n)$: For 
$n&lt;0$, $\oon{M}(n)=0$, $\oon{M}(0)=1$, and
\begin{equation}\label{grundrek}
\oon{M}(n)=\sum_{m\in M}\oon{M}(n-m)\ {\rm for}\ n&gt;0,
\end{equation}
which is well-defined even if $M$ is infinite: all members of $M$ are 
positive, so the sum in (\ref{grundrek}) has only finitely many non-zero 
terms.

One of the most famous examples of a sequence $(\oon{M}(n))_{n\ge0}$ is the 
sequence of Fibonacci numbers (\seqnum{A000045} in the Online 
Encyclopedia~\cite{oeis} with a shift of~1):
\[1,1,2,3,5,8,13,21,34,55,89,\ldots\]
Here, the underlying set is $M=\{1,2\}$. 

We can obtain almost the same sequence from an infinite underlying set, 
namely the set
\[M_2=\{1,3,5,7,9,11,\ldots\}\]
of odd positive integers. As sequence $(\oon{M_2}(n))_{n\ge0}$ we obtain
\[1,1,1,2,3,5,8,13,21,34,55,\ldots,\]
which looks (except for the beginning) quite like the Fibonacci numbers.
Similarly, for the set
\[M_1=\{2,3,4,5,6,7,\ldots\}\]
of all positive integers $\ge2$ the sequence $(\oon{M_1}(n))_{n\ge0}$
is
\[1,0,1,1,2,3,5,8,13,21,34,\ldots\]
-- again Fibonacci! 
However there is still another 
observation: If we add the last two sequences, we obtain the original 
Fibonacci sequence, except for the first item of the sequences. So we 
observe for all $n\in\Z$
\begin{equation}\label{zusatzaufruf}
\oon{M_1}(n)+\oon{M_2}(n)=\oon{M}(n)+\leer{n}.
\end{equation}
Here the sequence $(\leer{n})_{n\ge0}=(1,0,0,0,\ldots)$ is just the 
characteristic function of the value 0. Of course this observation is not 
surprising because of the recursion for the Fibonacci numbers, nontheless we 
will see that similar observations hold for very different and more 
complicated recursive sequences, even if they are not self-similar 
sequences as the three examples above.

Let us analyze how the sets $M$, $M_1$ and $M_2$ are related.
The numbers 1 and 2 of the set $M$ are the key for this analysis.
The set $M_1$ is \emph{1-periodic}, starting from the value~2.
The set $M_2$ is \emph{2-periodic}, starting from the value~1.
So $M_i$ is built from $M$ by deleting the entry $i$ and introducing a 
period $i$ instead, which applies for the remaining number and creates an 
\emph{infinite periodic set}.
A proof of
generalizations of the relation (\ref{zusatzaufruf}) will be the main topic 
of this paper.

In order to be able to formulate these generalizations we have to introduce 
some basic notation about multisets. 
For us, a multiset $\M$ is a pair $(M,w)$, consisting of a \emph{support 
set} $M\subseteq\N_{\ge1}$ and a \emph{multiplicity function} 
$w:\;\N_{\ge1}\longrightarrow\N_0$ with
\[M=\{m\in\N\mid w(m)&gt;0\}.\] 
We may also write
\[\M=[m_1,m_2,m_3,m_4,\ldots]\]
as a (possibly infinite) list of positive (possibly not distinct) integers 
such that every integer $j$ with $j=m_i$ occurs only finitely often in the 
list, namely exactly 
$w(j)$ times. 
The multiset $\M$ is \emph{finite} if $M$ is finite, otherwise 
\emph{infinite}.
We will in particular denote finite multisets by lists of the form
$[m_1,\ldots,m_N]$.
We denote the empty multiset $(\emptyset,w)$ simply by $\emptyset$. 
Let $\M_1=(M_1,w_1)$, $\M_2=(M_2,w_2)$ be multisets.
We say $\M_2\subseteq\M_1$ if, for all $n\in\N_{\ge1}$, $w_1(n)-w_2(n)\ge0$,
and we write $\M_2\subsetneqq\M_1$ if $\M_2\subseteq\M_1$ and 
$\M_2\neq\M_1$.
If $\M_2\subseteq\M_1$,
the multiset $\M_1-\M_2$ is defined as $(M_1',w_1-w_2)$, where 
\[M_1'=\{m\in M_1\mid w_1(m)-w_2(m)&gt;0\}.\]
Let $I$ be a set and, for all $i\in I$, $\M_i=(M_i,w_i)$ be a multiset.
Then the \emph{sum}
\[\bigoplus_{i\in I}\M_i=\left(\bigcup_{i\in I}M_i,\sum_{i\in I}w_i\right)\]
is defined in case $\sum_{i\in I}w_i(n)&lt;\infty$ for all $n\in\N$. 
We further define for a multiset $\M=(M,w)$ and a function 
$f:\Z\longrightarrow\Z$
\[\sum_{m\in\M}f(m):=\sum_{m\in M}w(m)f(m).\]


Linear recursions have been a classical topic in elementary and analytic 
combinatorics, for an overview see Flajolet and Sedgewick \cite{flased}.
Thinking of recursions, the above model can be easily generalized from 
sets $M$ to multisets~$\M$. 
Multisets fit to the partition model in the following sense. Think of 
the elements of a multiset $\M$ being colored in distinct colors. 
Then we want to count the number $\oo{M}(n)$ of additive partitions of a 
number $n$ into parts from $\M$, respecting the order of the associated 
colors. If $\M$ is a set, this coincides with our definition above. Again, 
for 
$n&gt;0$, we 
have $\oo{M}(-n)=0$, $\oo{M}(0)=1$ and the recursive formula
\begin{equation}\label{feinrek}
\oo{M}(n)=\sum_{m\in\M}\oo{M}(n-m).
\end{equation} From this linear recursion we obtain the ordinary generating 
function 
$F_\M(z)$ of the 
sequence $(\oo{M}(n))_{n\ge0}$, namely
\begin{eqnarray}
F_\M(z)&amp;=&amp;F_{\oo{M}}(z)=\sum_{n\ge0}\oo{M}(n)z^n
=1+\sum_{m\in\M}z^m\sum_{n\ge0}\oo{M}(n-m)z^{n-m}\nonumber\\
&amp;=&amp;\frac{\displaystyle 
1}{\displaystyle 
1-\sum_{m\in\M}z^m},\label{feingen}
\end{eqnarray}
which will have non-zero radius of convergence in the cases we will 
consider.

A multiset $\M'$ is \emph{periodic} if there are finitely many positive 
numbers
$m_2,\ldots,m_N$ and a positive number $m_1$ (the \emph{period}), so that
$\M'$ is the sum of all multisets of the form
\[[m_i,m_i+m_1,m_i+2m_1,m_i+3m_1,\ldots],\]
where $i=2,\ldots,N$.
We call the finite multiset $[m_1,m_2,\ldots,m_N]$ the \emph{finite 
core} of $\M'$ and denote $\M'$ by $\M_{[m_1]}$.
For periodic multisets we have the following results:

\begin{theorem}\label{singleeins}
Let $N\ge2$ and $\M=[m_1,m_2,\ldots,m_N]$ be a finite multiset.
Then, for any $n\in\Z$,
\[\oon{\M_{[m_1]}}(n)=\sum_{i=1}^N 
\oon{\M_{[m_1]}}(n-m_i)-\leer{n-m_1}+\leer{n}.\]
\end{theorem}

\begin{theorem}\label{singlemain}
Let $N\ge2$ and $\M=[m_1,m_2,\ldots,m_N]$ be a finite multiset. Then,
for any $n\in\Z$,
\[\sum_{i=1}^N \oon{\M_{[m_i]}}(n) = (N-1)\oo{M}(n) + \leer{n}.\]
\end{theorem}

Theorem \ref{singleeins} states that infinite periodic recursions, 
i.e., recursions coming from periodic multisets, can be written as the 
same finite recursion as their finite core, except for different 
initial values. Therefore they can be solved by the well-known analysis 
of finite linear recursions
(see, e.g., Matou\v{s}ek and Ne\v{s}et\v{r}il \cite{matnes}).
We, however, will not focus on the asymptotic analysis 
but on a different point, namely Theorem \ref{singlemain}, which gives us 
an exact additive relation between all periodic multisets with the same 
finite 
core and this core. We have already observed this phenomenon for the 
Fibonacci numbers.
We observe it as well for any finite multiset, e.g., for the  set 
$M=\{2,3,6\}$, where $(S_M(n))_{n\ge0}$ is the sequence \seqnum{A121833}
in Sloane's {\it Encyclopedia} \cite{oeis}.

Instead of proving Theorems \ref{singleeins} and~\ref{singlemain} 
directly, which could be done either elementary or 
analytic, we will formulate a more general setting and prove 
generalizations of the statements above.
Let $\M$ be a finite multiset, and $\PP=[p_1,\ldots,p_K]\subsetneqq\M$. 
Then 
the infinite 
\emph{multiperiodic} multiset $\M_\PP$ is defined as the union
of all (one-element) multisets of the form
\[[m+k_1p_1+k_2p_2+\ldots+k_Kp_K]\]
which are taken with multiplicity $\binom{\sum k_i}{k_1,\ldots,k_K}$, for 
all integers $k_1,\ldots,k_K\ge0$ and all $m\in\M-\PP$.
This is well-defined, since, for any $n\in\N$, there are only finitely many 
$(K+1)$-tuples $(m,k_1,\ldots,k_K)\in\N^{K+1}$ with 
\[m+k_1p_1+k_2p_2+\ldots+k_Kp_K=n.\]
(Recall that the multiplicities in our multisets are always finite, and 
$m,p_i&gt;0$.)
Again, we call $\M$ the \emph{finite core} of $\M_\PP$.
The recursion for $\M_\PP$ is
\[\oo{M_P}(n)=\sum_{m\in\M-\PP}\sum_{k_1=0}^{\infty}
\cdots\sum_{k_K=0}^{\infty} 
\binom{\sum k_i}{k_1,k_2,\ldots,k_K}\oo{M_P}(n-m-\sum_{i=1}^K 
k_ip_i)+\leer{n}\]
for all $n\in\Z$.


In Section \ref{xmain} we will formulate and prove the generalizations of 
Theorems \ref{singleeins} and~\ref{singlemain} concerning 
multiperiodicity. In the Section~\ref{discuss} we discuss a
further generalization.










\section{Main results}\label{xmain}



The following theorem generalizes Theorem \ref{singleeins}.

\begin{theorem}\label{thhaupt}
Let $N&gt;K\ge1$ and $\M=[m_1,m_2,\ldots,m_N]$ be a finite multiset.\\
 Let $\PP=[m_1,m_2,\ldots,m_K]$
and $\M^{\ast}=\M- \PP$. Then, for any $n\in\Z$,
\[\oo{\M_\PP}(n)=\sum_{i=1}^N \oo{\M_\PP}(n-m_i)-\sum_{s=1}^K 
\leer{n-m_s}+\leer{n}.\]
\end{theorem}

\begin{proof}
\begin{eqnarray*}
F_{\M_\PP}(z)
&amp;=&amp;
\frac{1}{\displaystyle{1-\sum_{m\in
\M^{\ast}}\sum_{k_1=0}^{\infty}\sum_{k_2=0}^{\infty}\cdots\sum_{k_K=0}^{\infty}
\binom{\sum_{j=1}^K k_j}{k_1,\ldots,k_K}z^{m+k_1m_1+k_2m_2+\ldots+k_Km_K}}}\\
&amp;=&amp;\frac{1}{\displaystyle{1-\sum_{m\in \M^{\ast}} z^m
\sum_{\nu=0}^{\infty}\sum_{\substack{k_1,\ldots,k_K\ge0\\ \sum_{j=1}^K k_j=\nu}} \binom{\nu}{k_1,\ldots,k_K}
\left(z^{m_1}\right)^{k_1}
\cdots\left(z^{m_K}\right)^{k_K}}}\\
&amp;=&amp;\frac{1}{\displaystyle{1-\sum_{m\in \M^{\ast}}z^m
\sum_{\nu=0}^{\infty}\left(z^{m_1}+z^{m_2}+\cdots+z^{m_K}\right)^{\nu}}}\\
&amp;=&amp;\frac{1}{\displaystyle{1-\sum_{m\in \M^{\ast}}z^m
\frac{1}{1-z^{m_1}-z^{m_2}-\cdots-z^{m_K}} }}\\
&amp;=&amp;\frac{\displaystyle{1-\sum_{s=1}^K z^{m_s}}}{\displaystyle{1-\sum_{i=1}^N z^{m_i}}}.
\end{eqnarray*}
In the first equation we used (\ref{feingen}),
in the third equation the multinomial theorem, in the fourth the  
geometric series. The last expression is the generating function $F_\M$ as 
in (\ref{feingen}) except for the different offset as in the statement of  
the theorem.
\end{proof}

We conclude that the sequence function of a multiperiodic multiset is 
dominated by the sequence function of its finite core:

\begin{corollary}
Let $N&gt;K\ge1$, $\M=[m_1,m_2,\ldots,m_N]$ be a finite multiset and 
$\PP=[m_1,\ldots,m_K]$.
Then, for any $n\in\Z$,
\[\oo{M_P}(n)\le\oo{M}(n).\]
\end{corollary}

\begin{proof}
This is because of $-\sum_{s=1}^K\leer{n-m_s}\le0$ in the statement of 
Theorem~\ref{thhaupt}.
\end{proof}

The next corollary could be used for an elementary proof of the main 
Theorem~\ref{thmende}, 
whereas our analytic proof uses Theorem \ref{thhaupt} directly.

\begin{corollary}
Let $N&gt;K\ge1$ and $\M=[m_1,m_2,\ldots,m_N]$ be a finite multiset. Then, for 
any $n\in\Z$,
\[\oo{M}(n)+(K-1)\oon{\M_{[m_1,\ldots,m_K]}}(n)-\sum_{j=1}^K 
\oon{\M_{[m_1,\ldots,m_{K+1}]-[m_j]}}(n) = K\oo{M}(n-m_{K+1}).\]
\end{corollary}


\begin{proof}\label{thzwischen}
We prove the corollary by induction on $n$. For $n\le0$ both sides are zero.
Let $n&gt;0$ and assume it has been proved for $n-1$. Then
\begin{eqnarray*}
&amp;&amp;\oo{M}(n)-K\oo{M}(n-m_{K+1})\\
&amp;\stackrel{{\rm by}\ (\ref{feinrek})}{=}&amp;
\sum_{i=1}^N\left[\oo{M}(n-m_i)-K\oo{M}(n-m_{K+1}-m_i)\right]-K\leer{n-m_{K+1}}\\
&amp;=&amp;\sum_{i=1}^N\left[\sum_{j=1}^K\oon{\M_{[m_1,\ldots,m_{K+1}]-[m_j]}}(n-m_i)-(K-1)\oon{\M_{[m_1,\ldots,m_K]}}(n-m_i)\right]\\ 
&amp;&amp;- K\leer{n-m_{K+1}}\\
&amp;=&amp;\sum_{j=1}^K 
\oon{\M_{[m_1,\ldots,m_{K+1}]-[m_j]}}(n)
-(K-1)\oon{\M_{[m_1,\ldots,m_K]}}(n)\\ 
&amp;&amp;+ 
\sum_{j=1}^K\left[\sum_{s=1}^{K+1}\leer{n-m_s}-\leer{n-m_j}\right]\\
&amp;&amp; - (K-1)\sum_{s=1}^K\leer{n-m_s} - K\leer{n-m_{K+1}}\\
&amp;=&amp;\sum_{j=1}^K 
\oon{\M_{[m_1,\ldots,m_{K+1}]-[m_j]}}(n)-(K-1)\oon{\M_{[m_1,\ldots,m_K]}}(n). 
\end{eqnarray*}
The second step is by induction hypothesis, and the third step by Theorem~\ref{thhaupt}.
\end{proof}

Now we formulate our main result, which generalizes 
Theorem~\ref{singlemain}:

\begin{theorem}\label{thmende}
Let $N&gt;K\ge1$ and $\M=[m_1,m_2,\ldots,m_N]$ be a finite multiset. Then, for 
any $n\in\Z$,
\[\binom{N-1}{K}\oo{M}(n) + \binom{N-1}{K-1}\leer{n} = 
\sum_{\{i_1,\ldots,i_K\}\subseteq\{1,\ldots,N\}}\oon{\M_{[m_{i_1},\ldots,m_{i_K}]}}(n).\]
\end{theorem}

\begin{proof}
By Theorem~\ref{thhaupt} we have
\begin{eqnarray*}
\sum_{\{i_1,\ldots,i_K\}\subseteq\{1,\ldots,N\}} 
F_{\M_{[m_{i_1},\ldots,m_{i_K}]}}(z)
&amp;=&amp;\sum_{\{i_1,\ldots,i_K\}\subseteq\{1,\ldots,N\}} 
\frac{\displaystyle1-\sum_{s=1}^K z^{m_{i_s}}}{\displaystyle1-\sum_{j=1}^N 
z^{m_j}}\\
&amp;=&amp;\frac{\displaystyle\binom{N}{K}\cdot1-\binom{N}{K}\frac{K}{N}\sum_{j=1}^N 
z^{m_j}}{\displaystyle1-\sum_{j=1}^N z^{m_j}}\\
&amp;=&amp;\frac{\displaystyle\binom{N-1}{K}}{\displaystyle1-\sum_{j=1}^N 
z^{m_j}}+\binom{N-1}{K-1}.
\end{eqnarray*}
In the last step we use 
\[\binom{N}{K}\frac{K}{N}=\binom{N-1}{K-1},
\quad{\rm resp.}\quad\binom{N}{K}=\binom{N-1}{K}+\binom{N-1}{K-1}.\]
We obtain the required linear combination of the generating functions of the 
sequences $(\oo{M}(n))_{n\ge0}$ and $(\leer{n})_{n\ge0}$.
\end{proof}

\begin{corollary}
Let $N\ge2$ and $\M=[m_1,\ldots,m_N]$ be a finite multiset. Then, for any 
$n\in\Z$,
\[\sum_{\emptyset\neq\PP\subsetneqq\M}\oo{M_P}(n)
=\left(2^{N-1}-1\right)\left(\oo{M}(n)+\leer{n}\right).\]
\end{corollary}

\begin{proof}
This follows from adding up the formula from Theorem~\ref{thmende} for all 
$K=1,\ldots,N-1$.
\end{proof}


\section{Final remark}\label{discuss}

Our results can be generalized to finite cores which are arbitrary 
(finite) linear recursions.
Instead of the initial value $\oo{M}(0)=1$,
which was 
motivated by the application of unordered partitions,
we may also assume
arbitrary (finite) initial values, i.e.,\ for a multiset $\M$ of positive 
integers 
and a $(D+1)$-vector $(c_0,c_1,\ldots,c_D)$ of
complex numbers $c_d$ we define the \emph{$c$-sequence function} $\oc{M}$ by 
the recursion
\[\oc{M}(n)=\sum_{m\in\M}\oc{M}(n-m)+\Phic(n)\]
for all $n\in\Z$, where
\[\Phic(n)=\sum_{d=0}^Dc_d\leer{n-d}.\]
Let further for a finite multiset $\PP$ of positive integers
\[\Phic_\PP(n)=\Phic(n)-\sum_{d=0}^Dc_d\sum_{m\in\PP}\leer{n-m-d}.\]

Then we can restate Theorems \ref{thhaupt} and~\ref{thmende} in the following way:

\begin{theorem}
Let $N&gt;K\ge1$ and $\M=[m_1,m_2,\ldots,m_N]$ be a finite multiset.\\
 Let $\PP=[m_1,m_2,\ldots,m_K]$. Then, for any $n\in\Z$,
\[\oc{M_P}(n)=\sum_{i=1}^N \oc{M_P}(n-m_i)+\Phic_\PP(n).\]
\end{theorem}

\begin{theorem}
Let $N&gt;K\ge1$ and $\M=[m_1,m_2,\ldots,m_N]$ be a finite multiset. Then, for 
any $n\in\Z$,
\[\binom{N-1}{K}\oc{M}(n) + \binom{N-1}{K-1}\Phic(n) = 
\sum_{\{i_1,\ldots,i_K\}\subseteq\{1,\ldots,N\}}\ocn{\M_{[m_{i_1},\ldots,m_{i_K}]}}(n).\]
\end{theorem}

For the proof of these generalizations we remark that we simply have to multiply the equations in the analytic proofs of Theorems \ref{thhaupt} and~\ref{thmende} by
\[\sum_{d=0}^Dc_dz^d,\]
which stands for the changed offset $\Phic(n)$.
The term $\Phic_\PP(n)$ comes from the product
\[\left(1-\sum_{m\in\PP}z^m\right)\left(\sum_{d=0}^Dc_dz^d\right).\]


This completes the discussion of recursions coming from multiperiodic multisets.


\section{Acknowledgment}

Thanks to Winfried Hochst\"{a}ttler for some helpful suggestions.


\begin{thebibliography}{9}

\bibitem{flased} P.~Flajolet and R.~Sedgewick,
\emph{Analytic Combinatorics}, 
Cambridge University Press, Cambridge, 2009.

\bibitem{matnes} J.~Matou\v{s}ek and J.~Ne\v{s}et\v{r}il, 
\emph{Invitation to Discrete Mathematics}, Oxford University Press, 1998.

\bibitem{oeis} N. J. A. Sloane, The Online Encyclopedia of Integer 
Sequences, \href{http://oeis.org}{\tt http://oeis.org}.

\end{thebibliography}


\bigskip
\hrule
\bigskip

\noindent 2010 {\it Mathematics Subject Classification}:
Primary 05A15; Secondary 05A17, 05A19, 11P81, 11P83.

\noindent \emph{Keywords: } 
periodic infinite recursion, unordered additive partition,
linear recurrence, sequence function, multiperiodicity, Fibonacci number.

\bigskip
\hrule
\bigskip

\noindent (Concerned with sequence
\seqnum{A000045} and
\seqnum{A121833}.)

\bigskip
\hrule
\bigskip

\vspace*{+.1in}
\noindent
Received May 11 2010;
revised version received  February 9 2011.
Published in {\it Journal of Integer Sequences},
March 25 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>