The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #14 Oct 31 2017 21:28:14
%S 1,5,169,19241,5216485,2769073949,2543467934449,3712914075133121,
%T 8094884285992309261,25137521105896509819605,
%U 107107542395866078895709049,607546536582495444795794603801,4474746926116218974619451907008885,41907652406924609850893820950967654989
%N Number of linear extensions of a poset whose Hasse diagram consists of n binary shrubs with type S_n joins.
%H Lars Blomberg, <a href="/A293953/b293953.txt">Table of n, a(n) for n = 0..100</a>
%H Jeffrey Remmel, S. Zheng, <a href="https://arxiv.org/abs/1611.09018">Rises in forests of binary shrubs</a>, arXiv preprint arXiv:1611.09018 [math.CO], 2016-2017.
%Y Cf. A293950, A293951, A293952.
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Oct 29 2017
%E Terms a(11) and beyond from _Lars Blomberg_, Oct 31 2017