cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A055544 Total number of nodes in all rooted trees with n nodes.

Original entry on oeis.org

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
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • 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 *)

Formula

a(n) = n*A000081(n).
G.f.: x * (d/dx) x * Product_{k>=1} 1/(1 - x^k)^(a(k)/k). - Ilya Gutkovskiy, May 26 2019