|
%I #13 Feb 05 2020 15:48:12
%S 1,0,0,0,0,0,0,0,1,9,45,165,495,1287,3003,6435,19305,243100,3981978,
%T 49959702,498967170,4190469570,30728937690,201931408074,1213163827326,
%U 6849350570700,39615797628550,296414654550300,3418235092302030
%N Exponential transform of C(n,8) = A000581.
%C a(n) is the number of ways of placing n labeled balls into indistinguishable boxes, where in each filled box 8 balls are seen at the top.
%C a(n) is also the number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains 8 labels.
%H Alois P. Heinz, <a href="/A145458/b145458.txt">Table of n, a(n) for n = 0..500</a>
%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F E.g.f.: exp(exp(x)*x^8/8!).
%p a:= proc(n) option remember; `if`(n=0, 1,
%p add(binomial(n-1, j-1) *binomial(j,8) *a(n-j), j=1..n))
%p end:
%p seq(a(n), n=0..35);
%t With[{nn=30},CoefficientList[Series[Exp[Exp[x] x^8/8!],{x,0,nn}],x] Range[ 0,nn]!] (* _Harvey P. Dale_, Feb 05 2020 *)
%Y 8th column of A145460, A143398.
%K nonn
%O 0,10
%A _Alois P. Heinz_, Oct 10 2008
|
