# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a000526
Showing 1-1 of 1

%I A000526 M5387 N2340 #41 Mar 24 2023 09:04:24
%S A000526 125,1296,8716,47787,232154,1040014,4395772,17781210,69498964,
%T A000526 264248924,982218072,3582421612,12857819052,45515994861,159205157535,
%U A000526 551049504784,1889714853263,6427147635062,21698583468717
%N A000526 Number of partially labeled trees with n nodes (5 of which are labeled).
%D A000526 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 138.
%D A000526 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000526 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000526 Vincenzo Librandi, <a href="/A000526/b000526.txt">Table of n, a(n) for n = 5..200</a>
%H A000526 <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F A000526 G.f.: A(x) = B(x)^5*(125-204*B(x)+118*B(x)^2-24*B(x)^3)/(1-B(x))^7, where B(x) is g.f. for rooted trees with n nodes, cf. A000081.
%p A000526 b:= proc(n) option remember; if n<=1 then n else add(k*b(k)* s(n-1, k), k=1..n-1)/(n-1) fi end: s:= proc(n,k) option remember; add(b(n+1-j*k), j=1..iquo(n,k)) end: B:= proc(n) option remember; add(b(k)*x^k, k=1..n) end: a:= n-> coeff(series(B(n-4)^5* (125-204*B(n-4) +118*B(n-4)^2 -24*B(n-4)^3)/ (1-B(n-4))^7, x=0, n+1),x,n): seq(a(n), n=5..23); # _Alois P. Heinz_, Aug 21 2008
%t A000526 b[n_] := b[n] = If[n <= 1, n, Sum[k*b[k]*s[n-1, k], {k, 1, n-1}]/(n-1)]; s[n_, k_] := s[n, k] = Sum[b[n + 1 - j*k], {j, 1, Quotient[n, k]}]; B[n_] := B[n] = Sum[b[k]*x^k, {k, 1, n}]; a[n_] := SeriesCoefficient[B[n-4]^5*(125 - 204*B[n-4] + 118*B[n-4]^2 - 24*B[n-4]^3)/(1 - B[n-4])^7, {x, 0, n}]; Table[a[n], {n, 5, 23}] (* _Jean-François Alcover_, Mar 20 2014, after _Alois P. Heinz_ *)
%Y A000526 Column k=5 of A034799.
%K A000526 nonn
%O A000526 5,1
%A A000526 _N. J. A. Sloane_
%E A000526 More terms from _Vladeta Jovovic_, Oct 19 2001

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE