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.

Showing 1-1 of 1 results.

A108526 Number of mobiles (cycle rooted trees) with n generators.

Original entry on oeis.org

1, 2, 5, 16, 54, 210, 841, 3555, 15402, 68336, 308206, 1410175, 6525500, 30492934, 143669529, 681781043, 3255653089, 15632422715, 75429279214, 365556955492, 1778608580060, 8684658137204, 42543288504844, 209022441144144
Offset: 1

Views

Author

Christian G. Bower, Jun 07 2005

Keywords

Comments

A generator is a leaf or a node with just one child.

Crossrefs

Programs

  • PARI
    CIK(p,n)={sum(d=1, n, eulerphi(d)/d*log(subst(1/(1+O(x*x^(n\d))-p), x, x^d)))}
    seq(n)={my(p=x); for(n=2, n, p += x^n*polcoef(x*p + CIK(p, n), n)); Vecrev(p/x)} \\ Andrew Howroyd, Aug 31 2018

Formula

G.f. satisfies (2-x)*A(x) = x - 1 + CIK(A(x)).
Showing 1-1 of 1 results.