A052829 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A052829

A simple grammar.

0, 1, 2, 4, 10, 25, 69, 197, 583, 1762, 5441, 17042, 54072, 173334, 560659, 1827306, 5995570, 19787135, 65643226, 218777532, 732181107, 2459576149, 8290442750, 28031056619, 95045477945, 323112137130, 1101073839413, 3760472582922, 12869488098939, 44127605854574

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

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

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 794

FORMULA

G.f.: (x/(1-x))*Product_{k>=1} (1+x^k)^a(k). - Vladeta Jovovic, Jul 22 2004

G.f. A(x) satisfies: A(x) = (x/(1 - x)) * exp(Sum_{k>=1} (-1)^(k+1) * A(x^k) / k). - Ilya Gutkovskiy, Jun 28 2021

MAPLE

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

CROSSREFS