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.

A081624 Number of 8-level labeled rooted trees with n leaves.

Original entry on oeis.org

1, 1, 8, 92, 1380, 25488, 558426, 14140722, 406005804, 13024655442, 461451524934, 17886290630832, 752602671853068, 34152212772528222, 1662095923363838817, 86335146917372644026, 4766427291743224251474, 278658370977555551901990
Offset: 0

Views

Author

Benoit Cloitre, Apr 23 2003

Keywords

References

  • J. Ginsburg, Iterated exponentials, Scripta Math., 11 (1945), 340-353.
  • T. Hogg and B. A. Huberman, Attractors on finite sets: the dissipative dynamics of computing structures, Phys. Review A 32 (1985), 2338-2346.

Crossrefs

Column k=7 of A144150.

Programs

  • PARI
    a(n)=local(X); if(n<0,0,X=x+x*O(x^n); n!*polcoeff(exp(exp(exp(exp(exp(exp(exp(exp(X)-1)-1)-1)-1)-1)-1)-1),n))

Formula

E.g.f.: exp(exp(exp(exp(exp(exp(exp(exp(x)-1)-1)-1)-1)-1)-1)-1).