Search: id:A054727
Results 1-1 of 1 results found.

%I A054727
%S A054727 1,2,7,33,181,1083,6854,45111,305629,2117283,14929212,106790500,
%T A054727 773035602,5652275723,41683912721,309691336359,2315772552485,
%U A054727 17415395593371,131632335068744,999423449413828
%N A054727 Number of forests of rooted trees with n nodes on a circle without crossing 
               edges.
%D A054727 P. Flajolet and M. Noy, Analytic Combinatorics of Noncrossing Configurations, 
               Discrete Math. 204 (1999), 203-229.
%H A054727 C. Banderier and D. Merlini, <a href="http://www.dsi.unifi.it/~merlini/
               poster.ps">Lattice paths with an infinite set of jumps</a>, FPSAC02, 
               Melbourne, 2002.
%H A054727 F. Cazals, <a href="http://algo.inria.fr/libraries/autocomb/NCC-html/
               NCC.html">Combinatorics of Non-Crossing Configurations</a>, Studies 
               in Automatic Combinatorics, Volume II (1997).
%H A054727 <a href="http://algo.inria.fr/flajolet/Publications">Source</a>
%H A054727 Philippe Flajolet, <a href="http://algo.inria.fr/libraries/autocomb/nc-configs-html/
               nc-configs1.html">Enumeration of planar configurations in computational 
               geometry</a>
%H A054727 P. Flajolet and R. Sedgewick, <a href="http://algo.inria.fr/flajolet/
               Publications/books.html">Analytic Combinatorics</a>, 2009; see page 
               486, 502
%F A054727 add(binomial(n, j - 1)*binomial(3*n - 2*j - 1, n - j)/(2*n - j), j = 
               1 .. n)
%p A054727 ZZ:=[F,{F=Union(Epsilon,ZB),ZB=Prod(Z1,P),P=Sequence(B),B=Prod(P,Z1,P),
               Z1=Prod(Z,F)}, unlabeled]: seq(count(ZZ,size=n),n=1..20); - Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), Apr 22 2007
%Y A054727 Cf. A006013.
%Y A054727 Sequence in context: A080119 A162257 A055724 this_sequence A086618 A162661 
               A104981
%Y A054727 Adjacent sequences: A054724 A054725 A054726 this_sequence A054728 A054729 
               A054730
%K A054727 nonn
%O A054727 1,2
%A A054727 Philippe Flajolet (Philippe.Flajolet(AT)inria.fr), Apr 20 2000

Search completed in 0.001 seconds