\documentclass[12pt,reqno]{article}

\usepackage[usenames]{color}
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsthm}
\usepackage{amsfonts}
\usepackage{amscd}
\usepackage{graphicx}

\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}
\usepackage{latexsym}
\usepackage{epsf}
\usepackage{breakurl}

\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}{\rm \underline{#1}}}
\newcommand{\Le}{\rotatebox[origin=c]{180}{$\Gamma$}}
\DeclareMathOperator{\sif}{sif}

\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 An Asymptotic Formula for the Number of \\
\vskip .1in
Stabilized-Interval-Free Permutations
}
\vskip 1cm
\large
Hyungju Park\\
Department of Mathematical Sciences \\
Seoul National University \\
08826 Seoul \\
Republic of Korea \\
\href{mailto:parkhyoungju@snu.ac.kr}{\tt parkhyoungju@snu.ac.kr} \\
\end{center}

\vskip .2 in
\begin{abstract}
Callan introduced stabilized-interval-free (SIF) permutations,
and Ardila, Rinc\'on, and Williams showed that connected positroids
bijectively correspond to SIF permutations unless the underlying set
is a singleton. In this paper, we derive an approximate formula for the
number of SIF permutations on the set $\{1,\ldots,N\}$ that refines the
previous result conjectured by Callan and proved by Salvatore and Tauraso.
\end{abstract}

\section{Introduction}

Let $[N]$ denote the set $\{1,\ldots,N\}$ for a positive integer $N$. A \textit{derangement} of the set $[N]$ is a permutation of the set without any fixed point. Let $d_N$ denote the number of derangements on the set $[N]$. The following classical formula for the number $d_N$ $$d_N=N!\sum_{i=0}^{N} \frac{(-1)^i}{i!},$$ which is the sequence \seqnum{A000166} in the On-Line Encyclopedia of Integer Sequences (OEIS) \cite{oeis}, is well known. Hassani \cite[Thm.\ 1.1]{MR1971432} proved that $d_N=\lfloor \frac{N!}{e}+\alpha\rfloor$ for every real number $\alpha\in [\frac{1}{3},\frac{1}{2}].$ This implies that the following approximate equality $$d_N=\frac{N!}{e}+O(1)$$ holds. Moreover, Hassani \cite{MR4134234} showed that the coefficients of the lower degree terms of this approximation are alternating Bell numbers $B_k$ $$d_N=\frac{N!}{e}+\sum_{k=1}^r(-1)^{N+k+1}\frac{B_k}{N^k}+O(N^{-r-1}).$$ These results all imply that the proportion of derangements among all permutations of the set $[N]$ is given by the following expression $$\frac{d_N}{N!}=\frac{1}{e}+O(N^{-k})$$ where $k$ is any positive integer.

Callan \cite{MR2049703} introduced a subclass of derangements known as \textit{stabilized-interval-free (SIF)} permutations, which satisfy a stronger condition than ordinary derangements. Callan proposed a conjectural asymptotic proportion of SIF permutations among all permutations of the set $[N]$. Specifically, it is conjectured that the proportion of SIF permutations among all permutations of $[N]$ is $$\frac{1}{e}\Bigg(1-\frac{1}{N}-\frac{5}{2N^2}+O(N^{-3})\Bigg).$$ Salvatore and Tauraso \cite{MR2467399} proved this conjecture using the recursive formula for the number of SIF permutations.

SIF permutations are related to mathematical objects called positroids. Postnikov \cite{Pos} introduced positroids, which are matroids represented by a real matrix with nonnegative maximal minors, and showed that positroids bijectively correspond to various combinatorial objects such as decorated permutations, Grassmann necklaces, $\Le$-diagrams, and move-equivalence classes of reduced plabic graphs. Ardila, Rinc\'on, and Williams \cite{MR3413866} showed that connected components of positroids form a noncrossing partition of the underlying set. Moreover, they showed that a positroid on a set of cardinality at least $2$ is connected if and only if it corresponds to a stabilized-interval-free (SIF) permutation. This result implies that the proportion of connected positroids among all positroids on the set $[N]$ approaches $\frac{1}{e^2}$ as $N\to\infty$. As pointed out in \cite{MR3413866}, this result stands in stark contrast to the fact, proven by Lowrance, Oxley, Semple, and Welsh in \cite{MR2996386}, that asymptotically almost all matroids are connected.

We present an alternative method for obtaining an asymptotic formula for the proportion of SIF permutations among all permutations, based on combinatorial arguments. Using our method, we may further compute lower degree terms of the asymptotic formula for the proportion of SIF permutations as follows: $$\frac{1}{e}\Bigg(1-\frac{1}{N}-\frac{5}{2N^2}-\frac{32}{3N^3}-\frac{1643}{24N^4}-\frac{23017}{40N^5}+O(N^{-6})\Bigg).$$

\section{The number of $\lambda$-cyclic intervals}

A \textit{cyclic interval} of $[N]$ is a subset of consecutive numbers modulo $N$. More generally, we define the notion of $\lambda$-cyclic interval associated with a partition $\lambda$.

\begin{definition}

For a partition $\lambda=(\lambda_1,\ldots,\lambda_l)\vdash n$, a collection of disjoint cyclic intervals is called a $\lambda$-cyclic interval if the partition obtained by sizes of cyclic intervals is $\lambda$.

\end{definition}

The following proposition provides a formula for the number of $\lambda$-cyclic intervals in the set $[N]$.

\begin{proposition}\label{prop:lamcyc}

Let $\lambda=(\lambda_1,...,\lambda_l)\vdash n$ be a partition that is not the partition $(N)$ with only one part. The number of $\lambda$-cyclic intervals in the set $[N]$ is expressed as follows: $$N\cdot \binom{N-n+l-1}{l-1}\frac{(l-1)!}{\prod_im_i(\lambda)!}$$ where $m_i(\lambda)$ is the number of indices $j$ such that $\lambda_j=i$.

\begin{proof}

Let $\alpha=(\alpha_1,\ldots,\alpha_l)\vDash n$ be a composition whose weakly decreasing rearrangement is $\lambda$. There are $\frac{l!}{\prod_im_i(\lambda)!}$ possible number of such compositions $\alpha$. The number of ways to choose the first cyclic interval of length $\alpha_1$ is $N$, and the number of ways to choose other intervals of length $\alpha_2,\ldots,\alpha_l$ according to this order is $\binom{N-n+l-1}{l-1}$. Multiplying the number of choices in each step, the total number of choices is $$N\cdot \binom{N-n+l-1}{l-1}\frac{l!}{\prod_im_i(\lambda)!}$$
Since each $\lambda$-cyclic interval is counted exactly $l$ times, dividing the total count by $l$ gives us the desired result.
    
\end{proof}
    
\end{proposition}

\section{The number of SIF permutations stabilizing a $\lambda$-cyclic interval}

Callan \cite{MR2049703} introduced a subclass of derangements known as \textit{stabilized-interval-free} permutations, which satisfy a stronger condition than ordinary derangements.

\begin{definition}

A permutation $\pi$ of the set $[N]$ is stabilized-interval-free (SIF) if for every proper interval $I\subset [N]$, $\pi(I)\neq I$.

\end{definition}

We define $\sif_N$ to be the number of SIF permutations of the set $[N]$. For each permutation $\pi$ of the set $[N]$, we let $\mathcal{I}_\pi$ denote the collection of all minimal nonempty cyclic intervals stabilized by $\pi$. The collection of lengths of cyclic intervals in $\mathcal{I}_\pi$, arranged in weakly decreasing order, forms a partition of the integer $N$. By definition, a permutation $\pi$ is a SIF permutation if and only if the partition obtained from the collection of lengths of cyclic intervals in $\mathcal{I}_\pi$ is $(N)$. A direct consequence of Proposition \ref{prop:lamcyc} is a formula for the number of pairs $(\pi,\mathcal{J})$, where $\pi$ is a derangement on the set $[N]$, and $\mathcal{J}$ is a $\lambda$-cyclic interval contained in the collection of cyclic intervals $\mathcal{I}_\pi$.

\begin{corollary}\label{cor:der}

Let $\lambda=(\lambda_1,\ldots,\lambda_l)\vdash n$ be a partition that is not $(N)$ and let $\sif_\lambda$ denote $\prod_{i=1}^l \sif_{\lambda_i}$. Let $D_\lambda(N)$ be the collection of all pairs $(\pi, \mathcal{J})$ of a derangement $\pi$ of the set $[N]$ and a $\lambda$-cyclic interval $\mathcal{J}$ contained in the collection $\mathcal{I}_\pi$. The number of pairs $(\pi,\mathcal{J})\in D_\lambda(N)$ is obtained by the following formula: \begin{equation*} 
|D_\lambda(N)|=\sif_\lambda\cdot d_{N-n}\cdot N\cdot \binom{N-n+l-1}{l-1}\frac{(l-1)!}{\prod_im_i(\lambda)!}.
\end{equation*}
This formula can be used to derive an asymptotic formula for the number $|D_\lambda(N)|$ as follows: 
\begin{equation}\label{eq:numpair}
|D_\lambda(N)|=\frac{N!}{e}\cdot\Bigg(\frac{\sif_\lambda}{\prod_im_i(\lambda)!}\cdot\frac{1}{(N-1)(N-2)\cdots (N-n+l)}+O(N^{-k})\Bigg)    
\end{equation} where $k$ is an arbitrary positive integer.

\begin{proof}

Since every cyclic intervals in $\mathcal{I}_\pi$ is minimal stabilized cyclic intervals of $\pi$, a pair $(\pi,\mathcal{J})$ satisfying the relation $\mathcal{J}\subseteq\mathcal{I}_\pi$ is determined by a $\lambda$-cyclic interval $\mathcal{J}$, SIF permutations of each cyclic intervals in $\mathcal{J}$, and a derangement of the set $[N]\setminus(\bigcup\mathcal{J})$. Therefore the first statement is immediate from Proposition \ref{prop:lamcyc}. The second statement is obtained by substituting the formula $d_{N-n}=\frac{(N-n)!}{e}(1+O(N^{-k}))$ for the number of derangements where $k$ is an arbitrary positive integer.

\end{proof}

\end{corollary}

\section{Asymptotic formula for the number of SIF permutations}

We prove the main result of this paper in this section. Using the result, we derive a more precise asymptotic formula for the number of SIF permutations. For a partition $\lambda$, let $|\lambda|$ denote the sum of all parts of $\lambda$ and let $l(\lambda)$ denote the number of parts of $\lambda$.

\begin{theorem}\label{thm:sif}

For a given positive integer $k$, the number of SIF permutations of the set $[N]$ is expressed by the following formula:
$$\sif_N=\frac{N!}{e}\Bigg(\sum_{\lambda}\frac{\sif_\lambda(-1)^{l(\lambda)}}{(\prod_{i}m_i(\lambda)!)(N-1)(N-2)\cdots (N-|\lambda|+l)}+O(N^{-k-1})\Bigg)$$ where the sum runs over all partitions $\lambda=(\lambda_1,\ldots,\lambda_{l(\lambda)})$ such that $|\lambda|-l(\lambda)\leq k$ and $1<\lambda_{l(\lambda)}$. If the partition $\lambda$ is the empty partition of the integer $0$, we treat the term $$\frac{\sif_\lambda(-1)^l}{(\prod_{i}m_i(\lambda)!)(N-1)(N-2)\cdots (N-|\lambda|+l)}$$ as a vacuous product with a value of $1$.

\begin{proof}

By the inclusion-exclusion principle, the number of SIF permutations on the set $[N]$ is given by the sum $\sum_{\lambda}(-1)^{l(\lambda)}|D_\lambda(N)|$ for all partitions $\lambda$ such that $|\lambda|\le N, \lambda\neq (N)$. Corollary~\ref{cor:der} implies that $|D_\lambda(N)|=\frac{N!}{e}\cdot O(N^{-k-1})$ unless $|\lambda|-l(\lambda)\le k$. Therefore, the sum can be expressed by using the big O notation $$\sif_N=\sum_{|\lambda|-l(\lambda)\le k}(-1)^{l(\lambda)}|D_\lambda(N)|+\frac{N!}{e}\cdot O(N^{-k-1}).$$ Substituting the asymptotic formula \eqref{eq:numpair} for the number $|D_\lambda(N)|$, the result follows.
    
\end{proof}
    
\end{theorem}

To obtain an explicit formula for the asymptotic number of SIF permutations, we make use of a well-known partial fraction decomposition formula for the inverse of the falling factorial $(x)_n:=x(x-1)\cdots (x-n+1)$. This formula is given by: \begin{equation} \label{eq:fallfact}
    \frac{(n-1)!}{(x)_n}=\frac{(n-1)!}{x(x-1)\cdots(x-n+1)}=\sum_{i=0}^{n-1}\frac{(-1)^{n-1+i} \binom{n-1}{i}}{x-i},
\end{equation} which can be derived by induction.

To compute the asymptotic formula up to the error term $O(N^{-k-1})$, it suffices to consider partitions $\lambda$ for which $|\lambda|-l(\lambda) \leq k$ by Theorem~\ref{thm:sif}. We will do this for $k=5$. The condition $|\lambda|-l(\lambda)=1,2,3,4,5$ is satisfied by the following collections of partitions:
\begin{align*}
|\lambda| - l(\lambda) = 1:\ & \{(2)\} \\
|\lambda| - l(\lambda) = 2:\ & \{(3), (2,2)\} \\
|\lambda| - l(\lambda) = 3:\ & \{(4), (3,2), (2,2,2)\} \\
|\lambda| - l(\lambda) = 4:\ & \{(5), (4,2), (3,3), (3,2,2), (2,2,2,2)\} \\
|\lambda| - l(\lambda) = 5:\ & \{(6), (5,2), (4,3), (4,2,2), (3,3,2), (3,2,2,2), (2,2,2,2,2)\}. \\
\end{align*}

Notice that each partition $\lambda$ satisfying $|\lambda|-l(\lambda)=k$ corresponds to a partition of $k$, obtained by subtracting $1$ from each part of the partition. For each of these collections of partitions, we can compute the sum $$\sum_{\lambda}\frac{\sif_\lambda(-1)^{l(\lambda)}}{\prod_{i}m_i(\lambda)!}$$ using the sequence $\sif_N$ listed as entry \seqnum{A075834} in Sloane's OEIS~\cite{oeis} as follows:
\begin{align*}
|\lambda| - l(\lambda) = 1:\ \sum_{\lambda}\frac{\sif_\lambda(-1)^{l(\lambda)}}{\prod_{i}m_i(\lambda)!} &= 1 \\
|\lambda| - l(\lambda) = 2:\ \sum_{\lambda}\frac{\sif_\lambda(-1)^{l(\lambda)}}{\prod_{i}m_i(\lambda)!} &= -2+\frac{1^2}{2!}=-\frac{3}{2} \\
|\lambda| - l(\lambda) = 3:\ \sum_{\lambda}\frac{\sif_\lambda(-1)^{l(\lambda)}}{\prod_{i}m_i(\lambda)!} &= -7+2\cdot 1-\frac{1^3}{3!}=-\frac{31}{6} \\
|\lambda| - l(\lambda) = 4:\ \sum_{\lambda}\frac{\sif_\lambda(-1)^{l(\lambda)}}{\prod_{i}m_i(\lambda)!} &= -34+7+\frac{2^2}{2!}-\frac{2\cdot 1^2}{2!}+\frac{1^4}{4!}=-\frac{623}{24} \\
|\lambda| - l(\lambda) = 5:\ \sum_{\lambda}\frac{\sif_\lambda(-1)^{l(\lambda)}}{\prod_{i}m_i(\lambda)!} &= -206+34+7\cdot 2-\frac{7\cdot 1^2}{2!}-\frac{2^2\cdot 1}{2!}+\frac{2\cdot 1^3}{3!}-\frac{1^5}{5!} \\
&= -\frac{6527}{40}. \\
\end{align*}

Here we used the values of $\sif_N$ for $N=1,\ldots,6$, which are $1,1,2,7,34,206$. Therefore, we have the following asymptotic formula for the number $\sif_N$ up to the error term $O(N^{-6})$: 

\begin{align*}
\sif_N = \frac{N!}{e} \Bigg(1 &- \frac{1}{N-1} \\
&- \frac{3}{2}\frac{1}{(N-1)(N-2)} \\
&- \frac{31}{6}\frac{1}{(N-1)(N-2)(N-3)} \\
&- \frac{623}{24}\frac{1}{(N-1)(N-2)(N-3)(N-4)} \\
&- \frac{6527}{40}\frac{1}{(N-1)(N-2)(N-3)(N-4)(N-5)}+ O(N^{-6}) \Bigg)
\end{align*}


We can expand the above formula using the partial fraction decomposition formula \ref{eq:fallfact} for the inverse of the falling factorial and the series expansion $$\frac{1}{N-m}=\sum_{i=1}^\infty\frac{m^{i-1}}{N^i}.$$

\begin{align*}
\sif_N = \frac{N!}{e}\Bigg(1 &-\Bigg(\frac{1}{N}+\frac{1}{N^2}+\frac{1}{N^3}+\cdots\Bigg) \\
&-\frac{3}{2}\Bigg(\Bigg(\frac{1}{N}+\frac{2}{N^2}+\frac{2^2}{N^3}+\cdots\Bigg)-\Bigg(\frac{1}{N}+\frac{1}{N^2}+\frac{1}{N^3}+\cdots\Bigg)\Bigg) \\
&-\frac{31}{6}\frac{1}{2!}\Bigg(\Bigg(\frac{1}{N}+\frac{3}{N^2}+\frac{3^2}{N^3}+\cdots\Bigg)-\binom{2}{1}\Bigg(\frac{1}{N}+\frac{2}{N^2}+\frac{2^2}{N^3}+\cdots\Bigg) \\
&+ \Bigg(\frac{1}{N}+\frac{1}{N^2}+\frac{1}{N^3}+\cdots\Bigg)\Bigg) \\
&- \frac{623}{24}\frac{1}{3!}\Bigg(\Bigg(\frac{1}{N}+\frac{4}{N^2}+\frac{4^2}{N^3}+\cdots\Bigg)-\binom{3}{2}\Bigg(\frac{1}{N}+\frac{3}{N^2}+\frac{3^2}{N^3}+\cdots\Bigg) \\
&+\binom{3}{1}\Bigg(\frac{1}{N}+\frac{2}{N^2}+\frac{2^2}{N^3}+\cdots\Bigg)-\Bigg(\frac{1}{N}+\frac{1}{N^2}+\frac{1}{N^3}+\cdots\Bigg)\Bigg) \\
&-\frac{6527}{40}\frac{1}{4!}\Bigg(\Bigg(\frac{1}{N}+\frac{5}{N^2}+\frac{5^2}{N^3}+\cdots\Bigg)-\binom{4}{3}\Bigg(\frac{1}{N}+\frac{4}{N^2}+\frac{4^2}{N^3}+\cdots\Bigg) \\
&+\binom{4}{2}\Bigg(\frac{1}{N}+\frac{3}{N^2}+\frac{3^2}{N^3}+\cdots\Bigg)-\binom{4}{1}\Bigg(\frac{1}{N}+\frac{2}{N^2}+\frac{2^2}{N^3}+\cdots\Bigg) \\
&+\Bigg(\frac{1}{N}+\frac{1}{N^2}+\frac{1}{N^3}+\cdots\Bigg)\Bigg)+O(N^{-6})\Bigg)
\end{align*}

Therefore, the coefficients of the terms $\frac{1}{N^k}$ for $k=1,2,3,4,5$ are given by: 
\begin{equation*}
\begin{split}
k = 1:\ & 1 \\
k = 2:\ & -1-\frac{3}{2}(2-1)=-\frac{5}{2} \\
k = 3:\ & -1-\frac{3}{2}(2^2-1)-\frac{31}{6\cdot 2!}(3^2-\binom{2}{1}2^2+1)=-\frac{32}{3} \\
k = 4:\ & -1-\frac{3}{2}(2^3-1)-\frac{31}{6\cdot 2!}(3^3-\binom{2}{1}2^3+1)-\frac{623}{24\cdot 3!}(4^3-\binom{3}{2}3^3+\binom{3}{1}2^3-1) \\
&=-\frac{1643}{24} \\
k = 5:\ & -1-\frac{3}{2}(2^4-1)-\frac{31}{6\cdot 2!}(3^4-\binom{2}{1}2^4+1)-\frac{623}{24\cdot 3!}(4^4-\binom{3}{2}3^4+\binom{3}{1}2^4-1) \\
&-\frac{6527}{40\cdot 4!}(5^4-\binom{4}{3}4^4+\binom{4}{2}3^4-\binom{4}{1}2^4+1)=-\frac{23017}{40}. \\
\end{split}
\end{equation*}

This gives the following asymptotic formula for $\sif_N$: $$\sif_N=\frac{N!}{e}\Bigg(1-\frac{1}{N}-\frac{5}{2N^2}-\frac{32}{3N^3}-\frac{1643}{24N^4}-\frac{23017}{40N^5}+O(N^{-6})\Bigg).$$

\section{Acknowledgment}

We thank an anonymous referee for several helpful comments and suggestions.

\begin{thebibliography}{1}

\bibitem{MR3413866}
Federico Ardila, Felipe Rinc\'{o}n, and Lauren Williams, Positroids and
  non-crossing partitions, {\em Trans. Amer. Math. Soc.} {\bf 368} (2016),
  337--363.

\bibitem{MR2049703}
David Callan, Counting stabilized-interval-free permutations, {\em J. Integer
  Sequences} {\bf 7} (2004), 
  \href{https://cs.uwaterloo.ca/journals/JIS/VOL7/Callan/callan91.html}{Article 04.1.8}.

\bibitem{oeis}
N.~J. A.~Sloane et. al., The {O}n-{L}ine {E}ncyclopedia of {I}nteger
  {S}equences, 2023.
\newblock Available at \url{https://oeis.org}.

\bibitem{MR1971432}
Mehdi Hassani, Derangements and applications, {\em J. Integer Sequences} {\bf 6}
  (2003), \href{https://cs.uwaterloo.ca/journals/JIS/VOL6/Hassani/hassani5.html}{Article 03.1.2}.

\bibitem{MR4134234}
Mehdi Hassani, Derangements and alternating sum of permutations by integration,
  {\em J. Integer Sequences} {\bf 23} (2020), 
  \href{https://cs.uwaterloo.ca/journals/JIS/VOL23/Hassani/hassani5.html}{Art. 20.7.8}.

\bibitem{MR2996386}
Lisa Lowrance, James Oxley, Charles Semple, and Dominic Welsh, On properties of
  almost all matroids, {\em Adv. in Appl. Math.} {\bf 50} (2013), 115--124.

\bibitem{Pos}
Alexander Postnikov, Total positivity, {Grassmannians}, and networks, preprint,
2006.  Available
  at \url{http://www-math.mit.edu/~apost/papers/tpgrass.pdf}.

\bibitem{MR2467399}
Paolo Salvatore and Roberto Tauraso, The operad {L}ie is free, {\em J. Pure
  Appl. Algebra} {\bf 213} (2009), 224--230.

\end{thebibliography}


\bigskip
\hrule
\bigskip

\noindent 2020 {\it Mathematics Subject Classification}:
Primary 05A16; Secondary 05A05.

\noindent \emph{Keywords:} derangement, stabilized-interval-free permutation, positroid.

\bigskip
\hrule
\bigskip

\noindent (Concerned with sequences
\seqnum{A000166} and
\seqnum{A075834}.)

\bigskip
\hrule
\bigskip

\vspace*{+.1in}
\noindent
Received May 4 2023;
revised versions received  October 27 2023; November 14 2023.
Published in {\it Journal of Integer Sequences}, November 15 2023.

\bigskip
\hrule
\bigskip

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


\end{document}
