login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A367753 Number of shapes of labeled forest of rooted hypertrees with n vertices. 0
1, 2, 8, 55, 507, 5969, 85605, 1445420, 28110615, 618760615, 15207174501, 412790636977, 12265337498000, 395962288858946, 13800754780797740, 516494067220932259, 20658199248901273576, 879406216174705907137, 39698270229941320201019, 1894212537494300993244732 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
See A367752 for the definition of the shape of a labeled rooted hypertree.
LINKS
FORMULA
E.g.f.: series reversion of (1+x)*log(1+log(1+x))*exp(-x).
PROG
(SageMath) R.<t>=PowerSeriesRing(QQ, 30); (1+t)*(ln(1+ln(1+t))*exp(-t)).reverse().egf_to_ogf().list()[1:]
(PARI) my(x='x+O('x^30)); Vec(serlaplace(serreverse((1+x)*log(1+log(1+x))*exp(-x)))) \\ Michel Marcus, Nov 30 2023
CROSSREFS
Sequence in context: A005440 A183282 A139016 * A134954 A087422 A081667
KEYWORD
nonn
AUTHOR
Paul Laubie, Nov 29 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 19:26 EDT 2024. Contains 375113 sequences. (Running on oeis4.)