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

%I A029768
%S A029768 0,1,1,2,7,36,245,2076,21059,248836,3356609,50896380,856958911,
%T A029768 15864014388,320245960333,7001257954796,164792092647355,
%U A029768 4154906594518116,111719929072986521,3191216673497748444
%N A029768 Number of increasing mobiles with n elements.
%C A029768 In an increasing rooted tree, nodes are numbered and numbers increase 
               as you move away from root.
%D A029768 F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like 
               Structures, Camb. 1998, p. 392.
%H A029768 <a href="Sindx_Mo.html#mobiles">Index entries for sequences related to 
               mobiles</a>
%H A029768 C. G. Bower, <a href="transforms2.html">Transforms</a>
%H A029768 C. G. Bower, <a href="transforms2.html">Transforms (2)</a>
%F A029768 Bergeron et al. give several formulae. Shifts left under "CIJ" (necklace, 
               indistinct, labeled) transform.
%t A029768 Multinomial1[list_] := Apply[Plus, list]!/Apply[Times, (#1! & ) /@ list]; 
               a[1]=1; a[n_]/;n>=2 := a[n] = Sum[Map[Multinomial1[ # ]Product[Map[a,
               # ]]/Length[ # ]&,Compositions[n-1]]]; Table[a[n],{n,8}] - David 
               Callan (callan(AT)stat.wisc.edu), Nov 29 2007
%Y A029768 Cf. A032220, A038037, A055356.
%Y A029768 Sequence in context: A088715 A088313 A095793 this_sequence A167199 A007889 
               A125033
%Y A029768 Adjacent sequences: A029765 A029766 A029767 this_sequence A029769 A029770 
               A029771
%K A029768 nonn,easy,eigen,nice
%O A029768 0,4
%A A029768 N. J. A. Sloane (njas(AT)research.att.com).
%E A029768 More terms from Christian G. Bower (bowerc(AT)usa.net)

Search completed in 0.001 seconds