A052798 G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^k)^5 * x^k / k ).

1, 1, 5, 40, 355, 3475, 35836, 384436, 4243860, 47905385, 550404336, 6415528666, 75677788275, 901728156490, 10837196405920, 131215506276862, 1599078373019073, 19598996116313001, 241433496694878595

Offset

0,3

Comments

Old name was: A simple grammar.

Links

Table of n, a(n) for n=0..18.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 755

Formula

G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^k)^5 * x^k / k ). - Ilya Gutkovskiy, May 26 2023

Maple

spec := [S, {S=PowerSet(B), B=Prod(Z, S, S, S, S, S)}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);

Crossrefs

Cf. A005754, A052755, A052775.

Sequence in context: A027259 A007036 A264227 * A137973 A371520 A052788

Adjacent sequences: A052795 A052796 A052797 * A052799 A052800 A052801

Keyword

easy,nonn

Author

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

Extensions

New name from Ilya Gutkovskiy, May 26 2023

Status

approved