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 A052781 #19 May 27 2023 05:50:29
%S A052781 1,1,6,46,421,4191,44322,487662,5527722,64091887,756590138,9062397539,
%T A052781 109866112785,1345528776005,16622049264020,206882949204038,
%U A052781 2591780764974800,32656149762325321,413563728245999232,5261307475883227222,67207527369932430625
%N A052781 G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} A(x^k)^5 * x^k / k ).
%C A052781 Appears to be the Euler transform of A052788. - _Falk Hüffner_, Dec 03 2015
%C A052781 Old name was: A simple grammar.
%H A052781 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=738">Encyclopedia of Combinatorial Structures 738</a>
%F A052781 G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} A(x^k)^5 * x^k / k ). - _Ilya Gutkovskiy_, May 26 2023
%p A052781 spec := [S,{B=Prod(Z,S,S,S,S,S),S=Set(B)},unlabeled]: seq(combstruct[count](spec,size=n), n=0..20);
%Y A052781 Cf. A005750, A052751, A052773.
%Y A052781 Cf. A052788.
%K A052781 easy,nonn
%O A052781 0,3
%A A052781 encyclopedia(AT)pommard.inria.fr, Jan 25 2000
%E A052781 New name from _Ilya Gutkovskiy_, May 26 2023