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.
%I A007311 M0676 #27 Oct 05 2022 04:58:33
%S A007311 1,-2,3,-5,7,-14,11,-66,-127,-992,-5029,-30899,-193321,-1285300,
%T A007311 -8942561,-65113125,-494605857,-3911658640,-32145949441,-274036507173,
%U A007311 -2419502677445,-22093077575496,-208364964369913,-2027216779571754,-20323053380033763,-209715614081160850
%N A007311 Reversion of o.g.f. for Bell numbers (A000110) omitting a(0)=1.
%C A007311 As the definition says, this entry deliberately omits the zero-th term 1. - _N. J. A. Sloane_, Jun 16 2021
%D A007311 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007311 <a href="/index/Res#revert">Index entries for reversions of series</a>
%F A007311 G.f. A(x) satisfies: A(x) = x - Sum_{k>=2} Bell(k) * A(x)^k. - _Ilya Gutkovskiy_, Apr 22 2020
%p A007311 read transforms; A := series(exp(exp(x)-1),x,60); SERIESTOLISTMULT(%); subsop(1=NULL,%); REVERT(%);
%p A007311 # Alternative, using function CompInv from A357588:
%p A007311 CompInv(26, n -> combinat:-bell(n)); # _Peter Luschny_, Oct 05 2022
%o A007311 (PARI) a(n)=if(n<1,0,polcoeff(serreverse(-1+serlaplace(exp(exp(x+x*O(x^n))-1))),n))
%Y A007311 Cf. A000110.
%K A007311 sign
%O A007311 1,2
%A A007311 _N. J. A. Sloane_, _Mira Bernstein_
%E A007311 Signs corrected Dec 24 2001