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.

A367753 Number of shapes of labeled forest of rooted hypertrees with n vertices.

Original entry on oeis.org

1, 2, 8, 55, 507, 5969, 85605, 1445420, 28110615, 618760615, 15207174501, 412790636977, 12265337498000, 395962288858946, 13800754780797740, 516494067220932259, 20658199248901273576, 879406216174705907137, 39698270229941320201019, 1894212537494300993244732
Offset: 1

Views

Author

Paul Laubie, Nov 29 2023

Keywords

Comments

See A367752 for the definition of the shape of a labeled rooted hypertree.

Crossrefs

Programs

  • PARI
    my(x='x+O('x^30)); Vec(serlaplace(serreverse((1+x)*log(1+log(1+x))*exp(-x)))) \\ Michel Marcus, Nov 30 2023
  • SageMath
    R.=PowerSeriesRing(QQ,30);(1+t)*(ln(1+ln(1+t))*exp(-t)).reverse().egf_to_ogf().list()[1:]
    

Formula

E.g.f.: series reversion of (1+x)*log(1+log(1+x))*exp(-x).
Showing 1-1 of 1 results.