login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055544 Total number of nodes in all rooted trees with n nodes. 5
1, 2, 6, 16, 45, 120, 336, 920, 2574, 7190, 20262, 57192, 162318, 461622, 1317165, 3766096, 10792399, 30980862, 89084844, 256524560, 739658472, 2135213982, 6170505665, 17849399616, 51679366125, 149750549260, 434260826883, 1260197855532, 3659410074932 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Eric Weisstein's World of Mathematics, Graph Vertex.

Eric Weisstein's World of Mathematics, Graph Edge

Index entries for sequences related to rooted trees

FORMULA

a(n) = n*A000081(n).

MAPLE

with(numtheory):

b:= proc(n) option remember; local d, j; `if`(n<2, n,

      (add(add(d*b(d), d=divisors(j)) *b(n-j), j=1..n-1))/ (n-1))

    end:

a:= n-> n*b(n):

seq(a(n), n=1..30);  # Alois P. Heinz, May 16 2013

MATHEMATICA

b[n_] := b[n] = If[n<2, n, (Sum[Sum[d*b[d], {d, Divisors[j]}]*b[n-j], {j, 1, n-1}])/(n-1)]; a[n_] := n*b[n]; Table[a[n], {n, 1, 30}] (* Jean-Fran├žois Alcover, Jan 25 2017, after Alois P. Heinz *)

CROSSREFS

Cf. A000081, A000169, A055543, A055544.

Sequence in context: A074413 A263897 A209629 * A126285 A026163 A005717

Adjacent sequences:  A055541 A055542 A055543 * A055545 A055546 A055547

KEYWORD

nonn

AUTHOR

Eric W. Weisstein

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 05:08 EST 2017. Contains 294853 sequences.