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.

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

This page as a plain text file.
%I A367753 #19 Dec 17 2023 10:27:10
%S A367753 1,2,8,55,507,5969,85605,1445420,28110615,618760615,15207174501,
%T A367753 412790636977,12265337498000,395962288858946,13800754780797740,
%U A367753 516494067220932259,20658199248901273576,879406216174705907137,39698270229941320201019,1894212537494300993244732
%N A367753 Number of shapes of labeled forest of rooted hypertrees with n vertices.
%C A367753 See A367752 for the definition of the shape of a labeled rooted hypertree.
%F A367753 E.g.f.: series reversion of (1+x)*log(1+log(1+x))*exp(-x).
%o A367753 (SageMath) R.<t>=PowerSeriesRing(QQ,30);(1+t)*(ln(1+ln(1+t))*exp(-t)).reverse().egf_to_ogf().list()[1:]
%o A367753 (PARI) my(x='x+O('x^30)); Vec(serlaplace(serreverse((1+x)*log(1+log(1+x))*exp(-x)))) \\ _Michel Marcus_, Nov 30 2023
%Y A367753 Cf. A052888, A210586, A364709, A364816, A367752.
%K A367753 nonn
%O A367753 1,2
%A A367753 _Paul Laubie_, Nov 29 2023