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


\DeclareMathOperator{\lcm}{lcm}
\newcommand\la{\langle}
\newcommand\ra{\rangle}
\newcommand\df{\emph}
\newcommand\ls{\leqslant}
\newcommand\nls{\nleqslant}
\newcommand\pos{\mathbf}
\newcommand\dg{\cellcolor{gray}}
\newcommand\g{\cellcolor{lightgray}}
\newcommand\tb[1][0.3cm]{\hspace*{#1}}
\newcommand\tab[1][0.7cm]{\hspace*{#1}}
\newcommand\taab[1][1.5cm]{\hspace*{#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}
\newtheorem{algorithm}[theorem]{Algorithm}

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

\begin{center}
\vskip 1cm{\LARGE\bf 
An Exact Enumeration of the \\
\vskip .1in
Unlabeled Disconnected Posets
}
\vskip 1cm
\large
Salah Uddin Mohammad, Md.\ Shah Noor, and Md.\ Rashed Talukder\\
Department of Mathematics\\
Shahjalal University of Science and Technology\\
Sylhet-3114 \\
Bangladesh\\
\href{mailto:salahuddin-mat@sust.edu}{\tt salahuddin-mat@sust.edu}\\
\href{mailto:msnoor-mat@sust.edu}{\tt msnoor-mat@sust.edu}\\
\href{mailto:r.talukder-mat@sust.edu}{\tt r.talukder-mat@sust.edu}
\end{center}

\vskip .2 in

\begin{abstract}  
We give an exact enumeration of the unlabeled disconnected posets
according to the number of connected components of the posets. This
result establishes that the enumeration of unlabeled posets belonging
to a class that is closed under the direct sum depends mainly on the
enumeration of unlabeled connected posets contained in the class. We also
give an algorithm to determine the parameters involved in the enumeration
formula, and finally, find the number of unlabeled disconnected posets
with a certain number of elements. We show that the enumeration algorithm
runs in polynomial time.
\end{abstract}

\section{Introduction}
We give an exact enumeration of the unlabeled disconnected posets belonging to a class of posets that is closed under the direct sum of posets. Let $\mathcal{P}_n$, $n\geq 1$ be the set of all $n$-element unlabeled posets. Also let $\mathcal{Q}_n$, $n\geq 1$ and $\mathcal{R}_n$, $n\geq 2$ be the sets of all $n$-element unlabeled connected and disconnected posets, respectively. Since the singleton poset is connected, we have $\mathcal{P}_1$ = $\mathcal{Q}_1$ and $|\mathcal{P}_1|$ = $|\mathcal{Q}_1|$ = 1. In general, for all $n\geq 2$, we have $\mathcal{P}_n$ = $\mathcal{Q}_n\cup\mathcal{R}_n$ and hence $|\mathcal{P}_n|$ = $|\mathcal{Q}_n|+|\mathcal{R}_n|$. We observe that every member of $\mathcal{R}_{n}$ can be expressed as the direct sum of two or more members from $\mathcal{Q}_{r}$, $1\leq r\leq n-1$. In our enumeration method, for finite $n\geq 2$, we express $|\mathcal{R}_{n}|$ as a finite series consisting of the numbers $|\mathcal{Q}_{r}|$, $r\leq n-1$ that gives the enumeration of the posets belonging to $\mathcal{R}_{n}$ according to the number of connected direct terms (components) of the posets. Here, we establish in general the criterion for the pairwise nonisomorphic direct sum of unlabeled posets obtained by Mohammad~\cite{Mohammad-2022} and used particularly for the enumeration of the class of $P$-series, a subclass of the class of series-parallel posets.
   
 For common enumeration methods, we refer the readers to~\cite{Brinkmann-Mckay-2002,Chaunier-Lygeros-1992,Heitzig-Reinhold-2000,Khamis-2006} for the enumeration of finite posets,~\cite{Bayoumi-Zahar-Khamis-1997,Bodirsky-Gimenez-Kang-Noy-2007} for graphs, and~\cite{Erne-1981,Koda-1994} for topologies. In the most of these cases, the enumeration of a class of structures was done by generating and counting all the pairwise nonisomorphic structures belonging to the class. The running time of these algorithms increases rapidly even though the structures under consideration are significantly small in size. Mainly, the running time for generating pairwise nonisomorphic structures make these algorithms highly time-complex. We observe that the steps for generating pairwise nonisomorphic disconnected posets in an enumeration process can be skipped. Therefore, the proposed exact enumeration method for the unlabeled disconnected posets must reduce the time-complexities of the algorithms for enumeration of unlabeled posets. Further, this enumeration method is applicable for the enumeration and generation of any unlabeled mathematical structures (posets, graphs, networks, topologies, and so on) belonging to a class that is closed under the direct sum of the structures.
 
 We also give an algorithm to determine the parameters involved in the enumeration formula and to compute the numbers $|\mathcal{R}_{n}|$ for $n\geq 2$. We show that the enumeration algorithm runs in polynomial time with complexity $\mathcal{O}(n^{5})$. We implement the enumeration algorithm into the computer and gather some numerical results. Brinkmann and McKay~\cite{Brinkmann-Mckay-2002} obtained the number of unlabeled posets up to $16$ elements, the sequence~\seqnum{A000112} in OEIS~\cite{Sloane-Plouffe-2022}. By using the number of unlabeled connected posets up to $16$ elements, we determine the number of unlabeled disconnected posets up to $17$ elements according to the number of connected direct terms of the posets, the sequences~\seqnum{A349401} and~\seqnum{A263864} in OEIS~\cite{Sloane-Plouffe-2022}. Khamis~\cite{Khamis-2004} obtained the number of unlabeled $N$-free posets up to $14$ elements according to the height of the posets, the sequence~\seqnum{A202182} in OEIS~\cite{Sloane-Plouffe-2022}. By using the number of unlabeled connected $N$-free posets up to $14$ elements, we determine the number of unlabeled disconnected $N$-free posets up to $15$ elements according to the number of connected direct terms of the posets, the sequences~\seqnum{A349367} and~\seqnum{A350783} in OEIS~\cite{Sloane-Plouffe-2022}.
 
  In Section~\ref{Preliminaries}, we recall some basic terminologies related to the posets and their direct sum. In Section~\ref{NonisomorphicSums}, we give the criterion for pairwise nonisomorphic direct sums of connected posets. In Section~\ref{EnumerationFormulas}, we establish the formulae giving the enumeration of disconnected posets. In Section~\ref{EnumerationAlgorithm}, we give the enumeration algorithm and prove its time-complexity. In Section~\ref{append}, we include the numerical results obtained by implementing the enumeration algorithm into the computer.
  


\section{Preliminaries}
\label{Preliminaries}
 A \df{poset} (\df{partially ordered set}) is a structure $\pos{A}=\la A,\ls \ra$ consisting of the nonempty set $A$ with the order relation $\ls$ on $A$. A poset $\pos{A}$ is called \df{finite} if the underlying set $A$ is finite. Here, we assume that every poset is finite. Let $\pos{A}=\la A,\ls_A\ra$ and $\pos{B}=\la B,\ls_B\ra$ be any posets. A bijective map $\phi: A\rightarrow B$ is called an \df{order isomorphism} if for all $x,y\in A$, $x\ls_A y$ if and only if $\phi(x)\ls_B \phi(y)$. We write $\pos{A}\cong \pos{B}$ whenever $\pos{A}$ and $\pos{B}$ are order isomorphic. By saying that a collection of posets is isomorphic (analogously, nonisomorphic), we mean that the posets in the collection are \df{pairwise} isomorphic (nonisomorphic). For further details on posets, we refer the readers to the classical book by Davey and Priestley~\cite{Davey-Priestley-2002}.
 
  We use the notation $\textbf{1}$ for the singleton poset, $\pos{C}_n$ ($n\geq 1$) for the $n$-element chain poset, $\pos{I}_n$ ($n\geq 1$) for the $n$-element antichain poset, $\pos{B}_{m,n}$ ($m\geq 1, n\geq 1$) for the complete bipartite poset with $m$ minimal elements and $n$ maximal elements. We write $\pos{A}+\pos{B}$ to denote the direct sum of $\pos{A}$ and $\pos{B}$. Here, $\pos{A}$ and $\pos{B}$ are called the \df{direct terms} (\df{components}) of the poset $\pos{A}+\pos{B}$. We write briefly $\sum_{i=1}^{r}\pos{A}_i$ for the direct sum $\pos{A}_1+\pos{A}_2+\cdots+\pos{A}_r$ and $r\pos{A}$ for the direct sum $\pos{A}$+$\pos{A}$+$\cdots$+$\pos{A}$ of $r$ posets $\pos{A}$. For example, $\pos{I_n}\cong n\pos{1}$. A poset having two or more direct terms is called \df{disconnected}, otherwise, it is called \df{connected}. Note that, for all posets $\pos{A}_{i}, \pos{B}_{i}$, $1\leq i\leq r$, since the direct sum of posets is commutative, we have $\sum_{i=1}^{r}\pos{A}_i$ $\cong$ $\sum_{i=1}^{r}\pos{B}_i$ if and only if $\pos{A}_{i}\cong\pos{B}_{i}$ for every $1\leq i\leq r$.



\section{Nonisomorphic direct sum criterion}
\label{NonisomorphicSums}
For unlabeled connected posets, in particular, we have $\mathcal{Q}_1=\{\pos{1}\}$, $\mathcal{Q}_2=\{\pos{C}_2\}$, and $\mathcal{Q}_3=\{\pos{B}_{1,2}$, $\pos{B}_{2,1}$, $\pos{C}_3\}$. For unlabeled disconnected posets, we have $\mathcal{R}_2=\{2\pos{1}\}$, $\mathcal{R}_3=\{1+\pos{C}_2$, $3\pos{1}\}$, and $\mathcal{R}_4=\{1+\pos{C}_3$, $1+\pos{B}_{1,2}$, $1+\pos{B}_{2,1}$, $\pos{C}_2+\pos{C}_2$, $2\pos{1}+\pos{C}_2$, $4\pos{1}\}$. We observe that, for every $2\leq n\leq 4$, every member of $\mathcal{R}_n$ can be expressed as the direct sum of some members of $\mathcal{Q}_r$, $1\leq r\leq 3$. In general, for $\pos{R}_n\in\mathcal{R}_n$, $n\geq 2$, there exist $\pos{Q}_{n_i}\in\mathcal{Q}_{n_i}$, $1\leq i\leq m$ such that

\begin{equation}
\label{equation-direct-sum-express}
 \pos{R}_n\cong\pos{Q}_{n_1}+\pos{Q}_{n_2}+\cdots+\pos{Q}_{n_m}=\sum_{i=1}^{m}\pos{Q}_{n_i},
\end{equation}
where $2\leq m\leq n$ and $n=\sum_{i=1}^{m}n_i$. Here, $m$ is the number of connected direct terms of $\pos{R}_n$. Since the direct sum of posets is commutative, we observe the following.
\begin{enumerate}
\item For $n=2$, we have $\pos{R}_2\cong\pos{Q}_1+\pos{Q}_1$. Thus an $\pos{R}_2$ can be obtained only in one way with 2 connected direct terms.
\item For $n=3$, we have $\pos{R}_3\cong\pos{Q}_1+\pos{Q}_2\cong\pos{Q}_2+\pos{Q}_1$ and $\pos{R}_3\cong\pos{Q}_1+\pos{Q}_1+\pos{Q}_1$. Thus, an $\pos{R}_3$ can be obtained in one way with 2 connected direct terms and in one way with 3 direct terms.
\item For $n=4$, all the ways in which an $\pos{R}_4$ can be obtained are given in Table~\ref{table-direct-sum-posets-n4}. Here, we see that an $\pos{R}_4$ can be obtained in two ways with 2 connected direct terms, in one way with 3 connected direct terms, and in one way with 4 connected direct terms. 
\end{enumerate}

\begin{table}[ht]
\centering 
\begin{tabular}{| c | r |}
\hline 
             Number of     &amp;Ways in which an\\ 
connected direct terms     &amp;$\pos{R}_4$ can be obtained\\ 
\hline\hline 
2    &amp;$\pos{Q}_2+\pos{Q}_2$\\
     &amp;and $\pos{Q}_1+\pos{Q}_3\cong\pos{Q}_3+\pos{Q}_1$\\
\hline 
3    &amp;$\pos{Q}_1+\pos{Q}_1+\pos{Q}_2\cong\pos{Q}_1+\pos{Q}_2+\pos{Q}_1$\\
     &amp;$\cong\pos{Q}_2+\pos{Q}_1+\pos{Q}_1$\\
\hline 
4    &amp;$\pos{Q}_1+\pos{Q}_1+\pos{Q}_1+\pos{Q}_1$\\
\hline 
\end{tabular}
\caption{All the ways in which an $\pos{R}_4$ can be obtained as a direct sum of $\pos{Q}_r$, $r\leq 3$.}
\label{table-direct-sum-posets-n4}
\end{table}

We see that if the posets $\pos{R}_n\in\mathcal{R}_n$ are obtained as above, some of the posets in $\mathcal{R}_n$ can be isomorphic even though the collection of direct terms $\pos{Q}_{n_i}$, $1\leq i\leq m$ is nonisomorphic. In this section, we establish the criterion for the direct sum so that all the posets in $\mathcal{R}_n$ obtained as the direct sum of the posets $\pos{Q}_{n_i}$, $1\leq i\leq m$ are nonisomorphic. Here, for every $1\leq r\leq n-1$, we must assume that the collection $\mathcal{Q}_r$ is nonisomorphic. To make our intuition more precise, we observe the connected direct terms of the posets $\pos{R}_6\in\mathcal{R}_6$. We see that an $\pos{R}_6$ can be obtained in all the ways given in Table~\ref{table-direct-sum-posets-n6}.
\begin{table}[ht]
\centering 
\begin{tabular}{| c | r |}
\hline 
             Number of&amp;     Ways in which an\\ 
connected direct terms&amp;     $\pos{R}_6$ can be obtained\\ 
\hline\hline 
2    &amp;$\pos{Q}_1+\pos{Q}_5$, $\pos{Q}_2+\pos{Q}_4$,\\
     &amp;and $\pos{Q}_3+\pos{Q}_3$\\
\hline 
3    &amp;$\pos{Q}_1+\pos{Q}_1+\pos{Q}_4$,\\
     &amp;$\pos{Q}_1+\pos{Q}_2+\pos{Q}_3$,\\
     &amp;and $\pos{Q}_2+\pos{Q}_2+\pos{Q}_2$\\
\hline 
4    &amp;$\pos{Q}_1+\pos{Q}_1+\pos{Q}_1+\pos{Q}_3$\\
     &amp;and $\pos{Q}_1+\pos{Q}_1+\pos{Q}_2+\pos{Q}_2$\\
\hline 
5    &amp;$\pos{Q}_1+\pos{Q}_1+\pos{Q}_1+\pos{Q}_1+\pos{Q}_2$\\
\hline 
6    &amp;$\pos{Q}_1+\pos{Q}_1+\pos{Q}_1+\pos{Q}_1+\pos{Q}_1+\pos{Q}_1$\\
\hline 
\end{tabular}
\caption{All the ways in which an $\pos{R}_6$ can be obtained as a direct sum of $\pos{Q}_r$, $r\leq 5$.}
\label{table-direct-sum-posets-n6}
\end{table}

Here, in Table~\ref{table-direct-sum-posets-n6}, we see that all the other direct sums in which an $\pos{R}_6$ can be obtained are isomorphic to one of the direct sums given in the table. This observation shows that all the direct sums in which a poset $\pos{R}_n$ can be obtained will be nonisomorphic if the sequence $\la n_1$, $n_2$, $\hdots$, $n_m\ra$, as in the equation~(\ref{equation-direct-sum-express}), is nondecreasing, that is, $n_1\leq n_2\leq \cdots \leq n_m$. We prove this conjecture in the following. Recall the assumption that, for every $1\leq r\leq n-1$, the collection $\mathcal{Q}_{r}$ is nonisomorphic.

\begin{theorem}
\label{theo-enum-disconn-posets}
 For all $\pos{R}_n\in\mathcal{R}_{n}$, let $\pos{R}_n=\sum_{i=1}^{m}\pos{Q}_{n_i}$, where $n=\sum_{i=1}^{m}n_i$ for some $2\leq m\leq n$, such that the sequences $\la n_1$, $n_2$, $\hdots$, $n_{m}\ra$ are all nondecreasing and distinct. Then for every pair of posets $\pos{R}_n, \pos{R'}_n\in\mathcal{R}_{n}$, we have $\pos{R}_n\ncong\pos{R'}_n$.
\end{theorem}

\begin{proof}
 For $\pos{R}_n,\pos{R'}_n\in\mathcal{R}_{n}$, let $\pos{R}_n\cong\sum_{i=1}^{m}\pos{Q}_{n_i}$ and $\pos{R'}_n\cong\sum_{i=1}^{m'}\pos{Q}_{r_i}$, as in the hypothesis, such that $L=\la n_1$, $n_2$, $\hdots$, $n_m\ra$ $\neq$ $\la r_1$, $r_2$, $\hdots$, $r_{m'}\ra=L'$. If $m\neq m'$ then $\pos{R}_n$ and $\pos{R'}_n$ have different numbers of connected direct terms and, clearly, $\pos{R}_n\ncong\pos{R'}_n$. Otherwise, let $m = m'$. In this case, since both $L$ and $L'$ contain nondecreasing lengths, there exist $1\leq s,t\leq m$, such that $n_i\neq r_i$ when $s\leq i\leq t$ and $n_i$ = $r_i$ otherwise (in the simplest case, for example, consider the sequences $\la 1$, $2$, $3$, $4$, $5\ra$ and $\la 1$, $2$, $2$, $5$, $5\ra$ where $s=3$ and $t=4$). Also, $r_i&lt;n_s$ or $n_i&lt;r_s$ for all $1\leq i\leq s-1$ (when $s&gt;1$); and $n_t&lt;r_i$ or $r_t&lt;n_i$ for all $t+1\leq i\leq m$ (when $t&lt;m-1$). Thus, there exist either $s\leq u\leq t$ such that $\pos{Q}_{n_u}\ncong \pos{Q}_{r_i}$ for all $1\leq i\leq m$, or $s\leq v\leq t$ such that $\pos{Q}_{r_v}\ncong \pos{Q}_{n_i}$ for all $1\leq i\leq m$. This shows that $\pos{R}_n\ncong\pos{R'}_n$.
\end{proof}



\section{Enumeration of unlabeled disconnected posets}
\label{EnumerationFormulas}

To determine $|\mathcal{R}_n|$, $n\geq 2$, the observations in the previous section suggest that, for certain $2\leq m\leq n$ (the number of connected direct terms of the $\pos{R}_n\in \mathcal{R}_n$), we must consider only the distinct nondecreasing sequences $\la n_1$, $n_2$, $\hdots$, $n_m\ra$, as given in the equation (\ref{equation-direct-sum-express}). In particular, we see that $|\mathcal{R}_6|$ can be computed by using the direct sums given in Table~\ref{table-direct-sum-posets-n6} and the numbers $|\mathcal{Q}_1|=|\mathcal{Q}_2|=1$, $|\mathcal{Q}_3|=3$, $|\mathcal{Q}_4|=10$, and $|\mathcal{Q}_5|=44$, see~\cite{Brinkmann-Mckay-2002,Chaunier-Lygeros-1992,Heitzig-Reinhold-2000}. Here, we use the notation $\mathcal{R}_n^{m}$ to denote the set of all posets $\pos{R}_n\in\mathcal{R}_n$ with $m$ connected direct terms. Then we have $\mathcal{R}_n$ = $\bigcup_{m=2}^{n}\mathcal{R}_n^{m}$. Since the collections $\mathcal{R}_n^{m}$, $2\leq m\leq n$ of unlabeled posets are pairwise disjoint, we have $|\mathcal{R}_n|$ = $\sum_{m=2}^{n}|\mathcal{R}_n^{m}|$. Firstly, we compute $|\mathcal{R}_6^{2}|$. For $\pos{R}_6\in \mathcal{R}_6^{2}$, we have the following cases.  
\begin{enumerate}
\item $\pos{R}_6\cong\pos{Q}_1+\pos{Q}_5$.\\
  Since the direct terms are the posets with unequal numbers of elements, in this case, we have $|\mathcal{Q}_1|\times |\mathcal{Q}_5| = 1\times 44 = 44$ disconnected posets.  
\item $\pos{R}_6\cong\pos{Q}_2+\pos{Q}_4$.\\
  Due to the reason same to the previous case, here, we have $|\mathcal{Q}_2|\times |\mathcal{Q}_4| = 1\times 10 = 10$ disconnected posets.  
\item $\pos{R}_6\cong\pos{Q}_3+\pos{Q}_3$.\\
  Since both the direct terms are the posets with the same number of elements (that is, a direct term in the expression is repeated), in this case, we have $\binom{|\mathcal{Q}_3|+2-1}{2} = \binom{3+1}{2} = 6$ disconnected posets.  
\end{enumerate}
These give
\begin{align*}
 |\mathcal{R}_6^{2}| = 44+10+6 = 60. 
\end{align*} 
Similarly, we have
\begin{align*}
 |\mathcal{R}_6^{3}| &amp; = 10+3+1 = 14,\\
 |\mathcal{R}_6^{4}| &amp; = 3+1 = 4,\\
 |\mathcal{R}_6^{5}| &amp; = 1, \text{ and}\\
 |\mathcal{R}_6^{6}| &amp; = 1.
\end{align*} 
Finally, we have 
\begin{align*}
 |\mathcal{R}_6| = \sum_{m=2}^{6}|\mathcal{R}_6^{m}| = 60+14+4+1+1 = 80.
\end{align*} 

In the following, we establish, in general, the above observations consecutively.
  
 
\begin{lemma}
\label{lemma-enum-discon-posets-si}
 For given $2\leq t\leq n$, let $\tilde{\mathcal{R}}_{n}^{t}\subseteq\mathcal{R}_{n}$ be the collection of posets such that for $\pos{R}_n\in\tilde{\mathcal{R}}_{n}^{t}$, we have $\pos{R}_n\cong\sum_{i=1}^{t}\pos{Q}_{n_i}$, where $n=\sum_{i=1}^{t}n_i$ and the sequence $\la n_1$, $n_2$, $\hdots$, $n_t\ra$ is strictly increasing. Then $|\tilde{\mathcal{R}}_{n}^{t}| = \prod_{i=1}^{t}|\mathcal{Q}_{n_i}|$.
\end{lemma}

\begin{proof}
 Let $\pos{R}_n\in\tilde{\mathcal{R}}_{n}^{t}$. As the sequence $\la n_1$, $n_2$, $\hdots$, $n_t\ra$ is strictly increasing, the direct terms $\pos{Q}_{n_i}$, $1\leq i\leq t$ of $\pos{R}_n$ have different cardinalities. Thus, all the $t$ direct terms of a poset $\pos{R}_n$ can be chosen consecutively from one of the disjoint collections $\mathcal{Q}_{n_1}$, $\mathcal{Q}_{n_2}$, $\hdots$, and $\mathcal{Q}_{n_t}$ each of which consists of all nonisomorphic connected posets. Therefore, $|\tilde{\mathcal{R}}_{n}^{t}|$ equals the number of the collections consisting of $t$ distinct items each of which is chosen consecutively from one of the collections consisting of $|\mathcal{Q}_{n_1}|$, $|\mathcal{Q}_{n_2}|$, $\hdots$, and $|\mathcal{Q}_{n_t}|$ distinct items, respectively. Therefore, we have $|\tilde{\mathcal{R}}_{n}^{t}|$ as follows: 
\begin{equation}
  |\tilde{\mathcal{R}}_{n}^{t}|=|\mathcal{Q}_{n_1}|\times |\mathcal{Q}_{n_2}|\times\cdots\times |\mathcal{Q}_{n_t}|=\prod_{i=1}^{t}|\mathcal{Q}_{n_i}|.
\end{equation}
\end{proof}


\begin{lemma}
\label{lemma-enum-discon-posets-const}
 For given $2\leq t\leq n$, let $\bar{\mathcal{R}}_{n}^{t}\subseteq\mathcal{R}_{n}$ be the collection of posets such that for $\pos{R}_n\in\bar{\mathcal{R}}_{n}^{t}$, we have $\pos{R}_n\cong\sum_{i=1}^{t}\pos{Q}_{n_i}$, where $n=\sum_{i=1}^{t}n_i$ and the sequence $\la n_1$, $n_2$, $\hdots$, $n_t\ra$ is constant. Then $|\bar{\mathcal{R}}_{n}^{t}| = \binom{|\mathcal{Q}_{r}|+t-1}{t}$, where $r=n_i$, $1\leq i\leq t$.
\end{lemma}

\begin{proof}
 Let $\pos{R}_n\in\bar{\mathcal{R}}_{n}^{t}$. As the sequence $\la n_1$, $n_2$, $\hdots$, $n_t\ra$ is constant, we assume $r=n_i$, $1\leq i\leq t$. Thus, every poset $\pos{Q}_{n_i}$, $1\leq i\leq t$ consists of $r$ elements. This shows that all the $t$ direct terms of a poset $\pos{R}_n$ can be chosen from the same collection $\mathcal{Q}_{r}$ consisting of $|\mathcal{Q}_{r}|$ nonisomorphic connected posets. Therefore, $|\bar{\mathcal{R}}_{n}^{t}|$ equals the number of $t$-element combinations of $|\mathcal{Q}_{r}|$ objects, with repetition. This gives $|\bar{\mathcal{R}}_{n}^{t}|$ as follows:
\begin{equation}
  |\bar{\mathcal{R}}_{n}^{t}| = \binom{|\mathcal{Q}_{r}|+t-1}{t}.
\end{equation}
\end{proof}


\begin{theorem}
\label{theo-enum-discon-posets-ndidl}
 For given $2\leq m\leq n$, let $\mathcal{R}_{n}^{m}\subseteq\mathcal{R}_{n}$ be the collection of posets such that for $\pos{R}_n\in\mathcal{R}_{n}^{m}$, we have $\pos{R}_n\cong\sum_{i=1}^{m}\pos{Q}_{n_i}$, where $n=\sum_{i=1}^{m}n_i$ and the sequence $\la n_1,n_2,\hdots,n_m\ra$ is nondecreasing. Then, there exist $q\leq m$ and $r_k$, $t_k$, $1\leq k\leq q$ such that $|\mathcal{R}_{n}^{m}| = \prod_{k=1}^{q}\binom{|\mathcal{Q}_{r_k}|+t_k-1}{t_k}$.
\end{theorem}

\begin{proof}
 Let $\pos{R}_n\in\mathcal{R}_{n}^{m}$. Since the sequence $\la n_1, n_2, \hdots, n_m\ra$, as in the hypothesis, is nondecreasing, there exist $q$ and $r_k$, $t_k$, $1\leq k\leq q$ such that
\begin{align*}
 r_1 &amp;= n_1 = n_2 = \cdots = n_{t_1},\\
 r_2 &amp;= n_{t_1+1} = n_{t_1+2} = \cdots = n_{t_1+t_2},\\
 r_3 &amp;= n_{t_1+t_2+1} = n_{t_1+t_2+2} = \cdots = n_{t_1+t_2+t_3},\\
     &amp;\vdots\\
 r_q &amp;= n_{t_1+\cdots+t_{q-1}+1} = n_{t_1+\cdots+t_{q-1}+2} =\cdots = n_m,
\end{align*} 
where $r_1&lt;r_2&lt;\cdots&lt;r_q$ and $m=t_1+\cdots+t_q$. Let $\pos{R}_{r_kt_k}\in\bar{\mathcal{R}}_{r_kt_k}^{t_k}$ be the $k$-th subcollection of $t_k$ consecutive connected direct terms of the poset $\pos{R}_n$. Then, for every $1\leq k\leq q$, the poset $\pos{R}_{r_kt_k}$ can be expressed as follows:
\begin{equation}
\label{equation-direct-sum-const}
 \pos{R}_{r_kt_k}\cong\underbrace{\pos{Q}_{r_k}+\pos{Q}_{r_k}+\cdots+\pos{Q}_{r_k}}_{t_k \text{ terms}}.
\end{equation}
Therefore, the poset $\pos{R}_n$ can be expressed as follows:
\begin{equation}
\label{equation-direct-sum-strt-increas}
 \pos{R}_n\cong\pos{R}_{r_1t_1}+\pos{R}_{r_2t_2}+\cdots+\pos{R}_{r_qt_q}. 
\end{equation} 
Since the sequence $\la r_k$, $r_k$, $\cdots$, $r_k\ra$ is constant, all of the $t_k$ direct terms $\pos{Q}_{r_k}$ in (\ref{equation-direct-sum-const}) are connected posets with $r_k$ elements. Then, by Lemma~\ref{lemma-enum-discon-posets-const}, we have $|\bar{\mathcal{R}}_{r_kt_k}^{t_k}|$ as follows:
\begin{equation}
\label{equation-enum-discon-posets-ndidl-part}
 |\bar{\mathcal{R}}_{r_kt_k}^{t_k}|=\binom{|\mathcal{Q}_{r_k}|+t_k-1}{t_k}.
\end{equation}
Since the sequence $\la r_1$, $r_2$, $\cdots$, $r_q\ra$ is strictly increasing, every direct term $\pos{R}_{r_kt_k}$ in (\ref{equation-direct-sum-strt-increas}) is itself a direct sum that consists of $t_k$ connected direct terms each consisting of $r_k$ elements. Then, by Lemma~\ref{lemma-enum-discon-posets-si}, we have $|\mathcal{R}_{n}^{m}|$ as follows:
\begin{equation*}
 |\mathcal{R}_{n}^{m}|=\prod_{k=1}^{q}|\bar{\mathcal{R}}_{r_kt_k}^{t_k}|.
\end{equation*}
Then, by using the equation (\ref{equation-enum-discon-posets-ndidl-part}), we have $|\mathcal{R}_{n}^{m}|$ as follows:
\begin{equation}
\label{equation-enum-formula-fixed-m}
 |\mathcal{R}_{n}^{m}|=\prod_{k=1}^{q}\binom{|\mathcal{Q}_{r_k}|+t_k-1}{t_k}.
\end{equation}
\end{proof}

Note that the value of the parameter $q$, as in the equation (\ref{equation-enum-formula-fixed-m}), equals the number of blocks with the same connected direct terms in the direct sum with $m$ terms as considered above. The following example illustrates Theorem~\ref{theo-enum-discon-posets-ndidl}.

\begin{example}
 Let $\mathcal{S}$ = $\{\pos{R}_{23}\in\mathcal{R}_{23}^{6} :$ $\pos{R}_{23}$ $\cong$ $\pos{Q}_3$ + $\pos{Q}_3$ + $\pos{Q}_4$ + $\pos{Q}_4$ + $\pos{Q}_4$ + $\pos{Q}_5\}$. Here, we describe the computation of $|\mathcal{S}|$ by using the equation (\ref{equation-enum-formula-fixed-m}). We have
\begin{align*} 
 \pos{R}_{23} &amp; \cong \pos{Q}_3 + \pos{Q}_3 + \pos{Q}_4 + \pos{Q}_4 + \pos{Q}_4 +  \pos{Q}_5\\
              &amp; \cong (\pos{Q}_3 + \pos{Q}_3) + (\pos{Q}_4 + \pos{Q}_4 + \pos{Q}_4) + (\pos{Q}_5)\\
              &amp; \cong \pos{R}_6 + \pos{R}_{12} + \pos{Q}_5 \text{ (say)},
\end{align*} 
where $\pos{R}_6$ $\cong$ $\pos{Q}_3$ + $\pos{Q}_3$ and $\pos{R}_{12}$ $\cong$ $\pos{Q}_4$ + $\pos{Q}_4$ + $\pos{Q}_4$. Note that, in the case of the direct sum considered above, the value of the parameter $q$ (the number of distinct blocks with repeated connected direct terms), as in the equation (\ref{equation-enum-formula-fixed-m}), equals $3$. Now we assume
\begin{align*} 
  \mathcal{S}_1 &amp; = \{\pos{R}_{6}\in\mathcal{R}_{6}^{2} : \pos{R}_{6}\cong\pos{Q}_3+\pos{Q}_3\},\\
  \mathcal{S}_2 &amp; = \{\pos{R}_{12}\in\mathcal{R}_{12}^{3} : \pos{R}_{12}\cong\pos{Q}_4+\pos{Q}_4+ \pos{Q}_4\},\text{ and }\\
  \mathcal{S}_3 &amp; = \mathcal{Q}_5.
\end{align*} 
Then 
\begin{align*} 
 \mathcal{S} = \mathcal{S}_1\cup\mathcal{S}_2\cup\mathcal{S}_3,
\end{align*} 
where the collections $\mathcal{S}_1$, $\mathcal{S}_2$, and $\mathcal{S}_3$ are pairwise disjoint. This implies
\begin{align*} 
 |\mathcal{S}| = |\mathcal{S}_1|\times |\mathcal{S}_2|\times |\mathcal{S}_3|.
\end{align*} 
Here, we have
\begin{align*} 
  |\mathcal{S}_1| &amp; = \binom{|\mathcal{Q}_3|+2-1}{2} = \binom{3+1}{2} = 6,\\ 
  |\mathcal{S}_2| &amp; = \binom{|\mathcal{Q}_4|+3-1}{3} = \binom{10+2}{3} = 220, \text{ and }\\
  |\mathcal{S}_3| &amp; = |\mathcal{Q}_5| = 44.
\end{align*} 
Therefore, 
\begin{align*} 
  |\mathcal{S}| = 6\times 220\times 44 = 58,080. 
\end{align*} 
\end{example}

Now, we give the enumeration formula for the unlabeled disconnected posets, in general, as follows:
 
\begin{theorem}
\label{theo-enum-disconn-posets-final}
 Let $\mathcal{R}_{n}$ be the collection of posets such that for $\pos{R}_n\in\mathcal{R}_{n}$, we have $\pos{R}_n\cong\sum_{i=1}^{m}\pos{Q}_{n_{ij}}$, $1\leq j\leq p_m$, $2\leq m\leq n$ for some $p_m\leq\binom{n-1}{m}$, where $n=\sum_{i=1}^{m}n_{ij}$, $1\leq j\leq p_m$ and all the sequences $\la n_{1j},n_{2j},\hdots,n_{mj}\ra$, $1\leq j\leq p_m$ are nondecreasing. Then, there exist $q_{mj}\leq m$ and $r_{mjk}$, $t_{mjk}$, $1\leq k\leq q_{mj}$, $1\leq j\leq p_m$, $2\leq m\leq n$ such that $|\mathcal{R}_{n}|=\sum_{m=2}^{n}\sum_{j=1}^{p_m}\prod_{k=1}^{q_{mj}}\binom{|\mathcal{Q}_{r_{mjk}}|+t_{mjk}-1}{t_{mjk}}$.
\end{theorem}

\begin{proof}
 Let $\pos{R}_n\in\mathcal{R}_{n}$. Then $\pos{R}_n\in\mathcal{R}_{n}^{mj}$ for some $1\leq j\leq p_m$ and $2\leq m\leq n$. Since the sequences $\la n_{1j},n_{2j},\hdots,n_{mj}\ra$, $1\leq j\leq p_m$, as in the hypothesis, are nondecreasing, there exist $q_{mj}$ and $r_{mjk}$, $t_{mjk}$, for $1\leq k\leq q_{mj}$, $1\leq j\leq p_m$, $2\leq m\leq n$ such that
\begin{align*} 
 r_{mj1} &amp;= n_{ij}, 1\leq i\leq t_{mj1},\\
 r_{mj2} &amp;= n_{ij}, t_{mj1}+1\leq i\leq t_{mj2},\\
 \vdots\\
 r_{mjq_{mj}} &amp;= n_{ij}, t_{mj(q-1)}+1\leq i\leq t_{mjq_{mj}},
\end{align*}
 where $r_{mj1}&lt;r_{mj2}&lt;\cdots&lt;r_{mjq_{mj}}$ and $m=t_{mj1}+\cdots+t_{mjq_{mj}}$. For certain $m$ and $j$, let $\pos{R}_{r_{mjk}t_{mjk}}\in\bar{\mathcal{R}}_{r_{mjk}t_{mjk}}^{t_{mjk}}$ be the $k$-th subcollection of $t_{mjk}$ consecutive direct terms of the poset $\pos{R}_n$. Then, for every $1\leq k\leq q_{mj}$, the poset $\pos{R}_{r_{mjk}t_{mjk}}$ can be expressed as follows:
\begin{equation}
\label{equation-direct-sum-const-gen}
 \pos{R}_{r_{mjk}t_{mjk}}\cong\underbrace{\pos{Q}_{r_{mjk}}+\pos{Q}_{r_{mjk}}+\cdots+\pos{Q}_{r_{mjk}}}_{t_{mjk} \text{ terms}}.
\end{equation}
Therefore, the poset $\pos{R}_n$ can be expressed as follows:
\begin{equation}
\label{equation-direct-sum-strt-increas-gen}
 \pos{R}_n\cong\pos{R}_{r_{mj1}t_{mj1}}+\pos{R}_{r_{mj2}t_{mj2}}+\cdots+\pos{R}_{r_{mjq_{mj}}t_{mjq_{mj}}}. 
\end{equation} 
Since the sequence $\la r_{mjk}$, $r_{mjk}$, $\cdots$, $r_{mjk}\ra$ is constant,  all of the $t_{mjk}$ direct terms $\pos{Q}_{r_{mjk}}$ in (\ref{equation-direct-sum-const-gen}) are connected posets with $r_{mjk}$ elements. Again, since the sequence $\la r_{mj1}$, $r_{mj2}$, $\cdots$, $r_{mjq_{mj}}\ra$ is strictly increasing, each of the direct terms $\pos{R}_{r_{mjk}t_{mjk}}$ in (\ref{equation-direct-sum-strt-increas-gen}) itself is a direct sum consisting of the connected direct terms having $r_{mjk}$ elements. Then, by Theorem~\ref{theo-enum-discon-posets-ndidl}, we have $|\mathcal{R}_{n}^{mj}|$ as follows:
\begin{equation}
\label{equation-direct-sum-nondecreas-gen}
 |\mathcal{R}_{n}^{mj}|=\prod_{k=1}^{q_{mj}}\binom{|\mathcal{Q}_{r_{mjk}}|+t_{mjk}-1}{t_{mjk}}.
\end{equation}
Since $|\mathcal{R}_{n}|$ equals the sum of $|\mathcal{R}_{n}^{mj}|$ for all possible values of $m$ and $j$, where $2\leq m\leq n$ and $1\leq j\leq p_m$ for some $p_m\leq\binom{n-1}{m}$, we have $|\mathcal{R}_{n}|$ as follows:
\begin{equation*}
 |\mathcal{R}_{n}|=\sum_{m=2}^{n}\sum_{j=1}^{p_m}|\mathcal{R}_{n}^{mj}|, n\geq 2. 
\end{equation*}
Finally, by using the equation (\ref{equation-direct-sum-nondecreas-gen}), we have $|\mathcal{R}_{n}|$ as follows: 
\begin{equation}
\label{equation-direct-sum-nondecreas-final}
 |\mathcal{R}_{n}|=\sum_{m=2}^{n}\sum_{j=1}^{p_m}\prod_{k=1}^{q_{mj}}\binom{|\mathcal{Q}_{r_{mjk}}|+t_{mjk}-1}{t_{mjk}}, n\geq 2.
\end{equation}
\end{proof}

Note that for every $2\leq m\leq n$, the value of the parameter $p_m$, as in (\ref{equation-direct-sum-nondecreas-final}), equals the number of nondecreasing sequences $\la n_1$, $n_2$, $\hdots$, $n_m\ra$, as in (\ref{equation-direct-sum-express}), where $n_i\in\{1, 2$, $\dots$, $n-1\}$ for all $1\leq i\leq m$. Also, for every $2\leq m\leq n$ and $1\leq j\leq p_m$, the value of the parameter $q_{mj}$, as in (\ref{equation-direct-sum-nondecreas-final}), equals the number of blocks with same connected direct terms in the direct sum corresponding to the $j$-th nondecreasing sequence with $m$ numbers as constructed above.



\section{Enumeration algorithm}
\label{EnumerationAlgorithm}

Recall that we do not determine explicitly the parameters $p_m$, $q_{mj}$, and $r_{mjk}$, where $1\leq k\leq q_{mj}$, $1\leq j\leq p_m$, and $2\leq m\leq n$, as in the equation (\ref{equation-direct-sum-nondecreas-final}). Therefore, for given $n\geq 2$, the computation of $|\mathcal{R}_{n}|$ depends on determining these parameters by constructing mainly the nondecreasing sequences $\la n_{1j},n_{2j},\hdots,n_{mj}\ra$ for all $1\leq j\leq p_m$ and $2\leq m\leq n$. Note that, by inspection, we have $p_m\leq n^2$ for all $2\leq m\leq n$. Also, we have $q_{mj}\leq m+1$ for all $1\leq j\leq p_m$ and $2\leq m\leq n$. Here, by using Algorithm~\ref{algor-count-disconn-posets} given below, we construct the nondecreasing sequences $\la n_{1j},n_{2j},\hdots,n_{mj}\ra$ and determine the parameters $p_m$, $q_{mj}$, $r_{mjk}$ for all $1\leq k\leq q_{mj}$, $1\leq j\leq p_m$, $2\leq m\leq n$, and finally compute the numbers $|\mathcal{R}_{n}|$ for $n\geq 2$. 
 

\begin{algorithm}
\label{algor-count-disconn-posets}
To compute $V=|\mathcal{R}_{n}|$, the number of $n$-element unlabeled disconnected posets, where $n\geq 2$ is fixed.
\begin{enumerate}
\item[(1)] Initialize $V=0$.
\item[(2)] Repeat (A) for $m=2$ to $n$.
 \begin{enumerate}
  \item[(A)] Repeat (i) to (iv) for every nondecreasing sequence $L(m,j)$ = $\la n_{1j}$, $n_{2j}$, $\hdots$, $n_{mj}\ra$, $1\leq j\leq p_m$ as is constructed in (i). (Here, the total number of repetitions equals the value of the parameter $p_m$ in the equation (\ref{equation-direct-sum-nondecreas-final})).
  \begin{enumerate}
    \item[(i)] Construct $j$-th nondecreasing sequence $L(m,j)$ consisting of $m$ integers chosen from the integers $1$, $2$, $\dots$, $n-1$.
    \item[(ii)] Initialize $S(m,j)$ as $S(m,j)=1$.
    \item[(iii)] Compute $t_{mjk}$ and repeat (a) below for every distinct $r_{mjk}$ in the sequence $L(m,j)$. (Here, the total number of distinct $r_{mjk}$ equals the value of the parameter $q_{mj}$ in the equation (\ref{equation-direct-sum-nondecreas-final})).
      \begin{enumerate}
         \item[(a)] Update $S(m,j)$ with $S(m,j)\times\binom{|\mathcal{Q}_{r_{mjk}}|+t_{mjk}-1}{t_{mjk}}$.    
      \end{enumerate}
    \item[(iv)] Increase $V$ by $S(m,j)$.    
  \end{enumerate}
 \end{enumerate}
\item[(3)] Return $V$.
\end{enumerate}
\end{algorithm}


\begin{lemma}
 Algorithm~\ref{algor-count-disconn-posets} runs in time $\mathcal{O}(n^{5})$.
\end{lemma}
\begin{proof}
 The constructions of the sequences $L(m,j)$ in the step (i) have complexity equal to $m(n-1)$. Since $1\leq t_{mjk}, q_{mj}\leq m+1$ and $t_{mjk}$ is inversely proportional to $q_{mj}$, the computations of $S(m,j)$ in the step (iii) have complexity equal to $m+1$. Then $m\leq n$ implies that the complexity $m(n-1)$ $\approx$ $\mathcal{O}(n(n-1))$ $\approx$ $\mathcal{O}(n^2)$ and the complexity $m+1$ $\approx$ $\mathcal{O}(n+1)$ $\approx$ $\mathcal{O}(n)$. Since $1\leq p_m\leq n^2$, the repetitions in the step (A) increase the complexity to $n^2(\mathcal{O}(n^2)$ + $\mathcal{O}(n))$ $\approx$ $\mathcal{O}(n^4)$. Finally, the repetitions in the step $(3)$ increase the complexity to $n(\mathcal{O}(n^4))$ $\approx$ $\mathcal{O}(n^5)$.
\end{proof}



\section{Data}
\label{append}
We implemented the enumeration algorithm into the computer and determined the number of unlabeled disconnected posets up to $17$ elements (Table~\ref{table-enum-disconn-posets-n13} and Table~\ref{table-enum-disconn-posets-n17}) and the number of unlabeled disconnected $N$-free posets up to $15$ elements (Table~\ref{table-enum-disconn-Nfree-posets-n15}) according to the number of connected direct terms of the posets.

\begin{table}[H]
\centering 
\resizebox{\columnwidth}{!}{%
\begin{tabular}{| c | r r r r r r r r r r r r |}
\hline
$m\diagdown$ $n$ &amp;2 &amp;3 &amp;4 &amp;5 &amp;6 &amp;7 &amp;8 &amp;9 &amp;10    &amp;11        &amp;12          &amp;13\\ 
\hline\hline 
2 &amp;1 &amp;1 &amp;4 &amp;13 &amp;60 &amp;312 &amp;2075 &amp;17316 &amp;186173 &amp;2594568 &amp;47041877 &amp;1108710868\\ 
3 &amp;  &amp;1 &amp;1 &amp;4  &amp;14 &amp;63  &amp;328   &amp;2159  &amp;17801  &amp;189406   &amp;2620368  &amp;47298156\\
4 &amp;  &amp;  &amp;1 &amp;1  &amp;4  &amp;14  &amp;64    &amp;331    &amp;2175   &amp;17885    &amp;189906    &amp;2623701\\
5 &amp;  &amp;  &amp;  &amp;1  &amp;1  &amp;4   &amp;14    &amp;64     &amp;332     &amp;2178     &amp;17901     &amp;189990\\
6 &amp;  &amp;  &amp;  &amp;   &amp;1  &amp;1   &amp;4     &amp;14     &amp;64      &amp;332       &amp;2179      &amp;17904\\
7 &amp;  &amp;  &amp;  &amp;   &amp;   &amp;1   &amp;1     &amp;4      &amp;14      &amp;64        &amp;332        &amp;2179\\
8 &amp;  &amp;  &amp;  &amp;   &amp;   &amp;    &amp;1     &amp;1      &amp;4       &amp;14        &amp;64         &amp;332\\
9 &amp;  &amp;  &amp;  &amp;   &amp;   &amp;    &amp;      &amp;1      &amp;1       &amp;4         &amp;14         &amp;64\\
10&amp;  &amp;  &amp;  &amp;   &amp;   &amp;    &amp;      &amp;       &amp;1       &amp;1         &amp;4          &amp;14\\
11&amp;  &amp;  &amp;  &amp;   &amp;   &amp;    &amp;      &amp;       &amp;        &amp;1         &amp;1          &amp;4\\
12&amp;  &amp;  &amp;  &amp;   &amp;   &amp;    &amp;      &amp;       &amp;        &amp;          &amp;1          &amp;1\\
13&amp;  &amp;  &amp;  &amp;   &amp;   &amp;    &amp;      &amp;       &amp;        &amp;          &amp;           &amp;1\\
\hline 
Total: &amp;1 &amp;2 &amp;6 &amp;19 &amp;80 &amp;395 &amp;2487 &amp;19890 &amp;\tb 206565 &amp;\tb 2804453 &amp;\tb 49872647 &amp;\tb 1158843214\\
\hline 
\end{tabular}
}
\caption{The number of $n$-element unlabeled disconnected posets for $2\leq n\leq 13$ according to the number of connected direct terms $m$, $2\leq m\leq 13$.}
\label{table-enum-disconn-posets-n13}
\end{table}


\begin{table}[H]
\centering 
\resizebox{\columnwidth}{!}{%
\begin{tabular}{| c | r r r r |}
\hline
$m\diagdown n$ &amp;14 &amp;15               &amp;16                 &amp;17\\ 
\hline\hline 
2  &amp;33887448384 &amp;1339579736074 &amp;68314951618033 &amp;4484639396830962\\ 
3  &amp;1111998749  &amp;33943069332   &amp;1340826402638  &amp;68351780482060\\
4  &amp;47324726     &amp;1112260708    &amp;33946401908     &amp;1340882409188\\
5  &amp;2624201      &amp;47328080       &amp;1112287428      &amp;33946665077\\
6  &amp;190006        &amp;2624285        &amp;47328580         &amp;1112290782\\
7  &amp;17905         &amp;190009          &amp;2624301          &amp;47328664\\
8  &amp;2179          &amp;17905           &amp;190010            &amp;2624304\\
9  &amp;332            &amp;2179            &amp;17905             &amp;190010\\
10 &amp;64             &amp;332              &amp;2179              &amp;17905\\
11 &amp;14             &amp;64               &amp;332                &amp;2179\\
12 &amp;4              &amp;14               &amp;64                 &amp;332\\
13 &amp;1              &amp;4                &amp;14                 &amp;64\\
14 &amp;1              &amp;1                &amp;4                  &amp;14\\
15 &amp;               &amp;1                &amp;1                  &amp;4\\
16 &amp;               &amp;                 &amp;1                  &amp;1\\
17 &amp;               &amp;                 &amp;                   &amp;1\\
\hline 
Total:&amp;35049606566 &amp;\tab 1374685228988 &amp;\tab 69690886873398 &amp;\tab 4554367168841547\\
\hline 
\end{tabular}
}
\caption{The number of $n$-element unlabeled disconnected posets for $14\leq n\leq 17$ according to the number of connected direct terms $m$, $2\leq m\leq 17$.}
\label{table-enum-disconn-posets-n17}
\end{table}


\begin{table}[H]
\centering 
\resizebox{\columnwidth}{!}{%
\begin{tabular}{| c | r r r r r r r r r r r r r r |}
\hline
$m\diagdown n$ &amp;2 &amp;3 &amp;4 &amp;5 &amp;6 &amp;7 &amp;8 &amp;9     &amp; 10     &amp; 11     &amp; 12      &amp; 13        &amp; 14         &amp; 15\\ 
\hline\hline 
 2 &amp; 1 &amp; 1 &amp; 4 &amp; 12 &amp; 46 &amp; 173 &amp; 727 &amp; 3195 &amp; 15017 &amp; 74404 &amp; 388895 &amp; 2134070 &amp; 12266637 &amp; 73642052\\
 3 &amp;   &amp; 1 &amp; 1 &amp;  4 &amp; 13 &amp;  49 &amp; 188 &amp;   795 &amp;  3502 &amp; 16436 &amp;  81146 &amp;   421816 &amp;  2300237 &amp; 13134628\\
 4 &amp;   &amp;   &amp; 1 &amp;  1 &amp;  4 &amp;  13 &amp;  50 &amp;   191 &amp;    810 &amp;  3570 &amp;  16758 &amp;    82655 &amp;    429138 &amp;  2336477\\
 5 &amp;   &amp;   &amp;   &amp;  1 &amp;  1 &amp;   4 &amp;  13 &amp;    50 &amp;    192 &amp;    813 &amp;   3585 &amp;    16826 &amp;     82977 &amp;    430668\\
 6 &amp;   &amp;   &amp;   &amp;    &amp;  1 &amp;   1 &amp;   4 &amp;    13 &amp;     50 &amp;    192 &amp;     814 &amp;     3588 &amp;     16841 &amp;     83045\\
 7 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;   1 &amp;   1 &amp;     4 &amp;     13 &amp;     50 &amp;     192 &amp;       814 &amp;      3589 &amp;     16844\\
 8 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;     &amp;   1 &amp;     1 &amp;      4 &amp;     13 &amp;      50 &amp;       192 &amp;        814 &amp;      3589\\
 9 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;     &amp;     &amp;     1 &amp;      1 &amp;      4 &amp;      13 &amp;        50 &amp;        192 &amp;        814\\
10 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;     &amp;     &amp;       &amp;      1 &amp;      1 &amp;       4 &amp;        13 &amp;         50 &amp;        192\\
11 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;     &amp;     &amp;       &amp;        &amp;      1 &amp;       1 &amp;         4 &amp;         13 &amp;         50\\
12 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;     &amp;     &amp;       &amp;        &amp;        &amp;       1 &amp;         1 &amp;          4 &amp;         13\\
13 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;     &amp;     &amp;       &amp;        &amp;        &amp;         &amp;         1 &amp;          1 &amp;          4\\
14 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;     &amp;     &amp;       &amp;        &amp;        &amp;         &amp;           &amp;          1 &amp;          1\\
15 &amp;   &amp;   &amp;   &amp;    &amp;    &amp;     &amp;     &amp;       &amp;        &amp;        &amp;         &amp;           &amp;            &amp;          1\\
\hline
Total: &amp;1 &amp;2 &amp;6 &amp;18 &amp;65 &amp;241 &amp;984 &amp;4250 &amp;19590 &amp;95484 &amp;491459 &amp;2660030 &amp;15100494  &amp;89648378 \\
\hline 
\end{tabular}
}
\caption{The number of $n$-element unlabeled disconnected $N$-free posets for $2\leq n\leq 15$ according to the number of connected direct terms $m$, $2\leq m\leq 15$.}
\label{table-enum-disconn-Nfree-posets-n15}
\end{table}

\section{Acknowledgment}
This work was supported by the Research Grant 2020-21, SUST Research Center, Shahjalal University of Science and Technology, Sylhet-3114, Bangladesh [Grant no. PS/2020/1/19]. Special thanks to the anonymous referee for carefully reading the manuscript and giving many corrections and suggestions for the improved presentations of the results.


\begin{thebibliography}{99}

\bibitem{Bayoumi-Zahar-Khamis-1997}
B. I. Bayoumi, M. H. El-Zahar, and S. M. Khamis, Algorithmic counting of types of UPO graphs and posets, \textit{Congr. Numer.} \textbf{127} (1997), 117--122.

\bibitem{Bodirsky-Gimenez-Kang-Noy-2007}
M. Bodirsky, O. Gim\'enez, M. Kang, and M. Noy, Enumeration and limit laws for series-parallel graphs, \textit{European J. Combin.} \textbf{28} (2007), 2091--2105.	

\bibitem{Brinkmann-Mckay-2002}
G. Brinkmann and B. McKay, Posets on up to 16 Points, \textit{Order} \textbf{19} (2002), 147--179.

\bibitem{Chaunier-Lygeros-1992}
C. Chaunier and N. Lygeros, The number of orders with thirteen elements, \textit{Order} \textbf{9} (3) (1992), 203--204.

\bibitem{Davey-Priestley-2002}
B. A. Davey and H. A. Priestly, \textit{Introduction to Lattices and Order}, 2nd Edition, Cambridge University Press, 2002.

\bibitem{Erne-1981}
M. Ern\'e, On the cardinalities of finite topologies and the number of antichains in partially ordered sets, \textit{Discrete Math.} \textbf{35} (1981), 119--133.

\bibitem{Heitzig-Reinhold-2000}
J. Heitzig and J. Reinhold, The number of unlabeled orders on fourteen elements, \textit{Order} \textbf{17} (2000), 333--341.

\bibitem{Khamis-2000}
S. M. Khamis, On numerical counting of prime, UPO, and the general type of posets according to heights, \textit{Congr. Numer.} \textbf{146} (2000), 157--171.

\bibitem{Khamis-2004}
S. M. Khamis, Height counting of unlabeled interval and $N$-free posets, \textit{Discrete Math.} \textbf{275} (2004), 165--175.

\bibitem{Khamis-2006}
S. M. Khamis, Recognition of prime posets and one of its applications, \textit{J. Egypt. Math. Soc.} \textbf{14} (2006), 5--13.

\bibitem{Koda-1994}
Y. Koda, The numbers of finite lattices and finite topologies, \textit{Bull. Inst. Combin. Appl.} \textbf{10} (1994), 83--89.

\bibitem{Mohammad-2022}
S. U. Mohammad, \textit{A Study of Recognition and Enumeration for Decomposable Ordered Sets}, Ph.D. Thesis, Dept.\ of Mathematics, Shahjalal University of Science and Technology, Sylhet-3114, Bangladesh, 2022.

\bibitem{Sloane-Plouffe-2022}
N. J. A. Sloane et al., The On-Line Encyclopedia of Integer Sequences, 2022. Available at \url{https://oeis.org}.

\end{thebibliography}


\bigskip
\hrule
\bigskip

\noindent 2020 {\it Mathematics Subject Classification}: Primary 06A07; Secondary 05A15, 11Y55. 

\noindent \emph{Keywords: } unlabeled posets, exact enumeration, direct sum, enumeration algorithm, polynomial time-complexity.

\bigskip
\hrule
\bigskip

\noindent (Concerned with sequences
\seqnum{A000112},
\seqnum{A202182},
\seqnum{A263864},
\seqnum{A349367},
\seqnum{A349401}, and
\seqnum{A350783}.)

\bigskip
\hrule
\bigskip

\vspace*{+.1in}
\noindent
Received February 08 2022;
revised version received June 5 2022.
Published in {\it Journal of Integer Sequences}, June 16 2022.

\bigskip
\hrule
\bigskip

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


\end{document}

                                                                                

                                                                                

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