login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000242 3rd power of rooted tree enumerator; number of linear forests of 3 rooted trees.
(Formerly M2798 N1126)
6
1, 3, 9, 25, 69, 186, 503, 1353, 3651, 9865, 26748, 72729, 198447, 543159, 1491402, 4107152, 11342826, 31408719, 87189987, 242603970, 676524372, 1890436117, 5292722721, 14845095153, 41708679697, 117372283086, 330795842217 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,2

REFERENCES

J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 150.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=3..200

Index entries for sequences related to rooted trees

FORMULA

G.f.: B(x)^3 where B(x) is g.f. of A000081.

a(n) ~ 3 * A187770 * A051491^n / n^(3/2). - Vaclav Kotesovec, Jan 03 2021

MAPLE

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-2)^3, x=0, n+1), x, n): seq(a(n), n=3..29); # Alois P. Heinz, Aug 21 2008

MATHEMATICA

max = 29; 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]}]; f[x_] := Sum[ b[k]*x^k, {k, 0, max}]; Drop[ CoefficientList[ Series[f[x]^3, {x, 0, max}], x], 3] (* Jean-François Alcover, Oct 25 2011, after Alois P. Heinz *)

CROSSREFS

Column 3 of A339067.

Cf. A000081, A000106, A000300, A000343, A000395.

Sequence in context: A338726 A323362 A201533 * A077846 A005322 A103780

Adjacent sequences: A000239 A000240 A000241 * A000243 A000244 A000245

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Christian G. Bower, Nov 15 1999

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 03:48 EST 2022. Contains 358672 sequences. (Running on oeis4.)