This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052896 E.g.f.: (exp(exp(x)-1)-1)^2. 1
 0, 0, 2, 12, 64, 350, 2024, 12460, 81638, 567888, 4180848, 32470834, 265219332, 2271692124, 20350705418, 190216812260, 1850993707960, 18714559108142, 196237054861920, 2130518566431620, 23912733627261670, 277078872201375976, 3310142647325149512 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Previous name was: A simple grammar. a(n) is the number of ways to place n labeled balls into unlabeled (but two-colored) boxes so that at least one box is red and one box is blue. - Geoffrey Critzer, Oct 16 2011 LINKS INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 872 FORMULA E.g.f.: exp(exp(x)-1)^2 - 2*exp(exp(x)-1) + 1. For n >= 1: a(n) = Sum_{k=0...n} Stirling2(n,k)*(2^k-2) where Stirling2(n,k) is the number of set partitions of {1,2,...,n} into exactly k blocks (A008277). MAPLE spec := [S, {B=Set(Z, 1 <= card), C=Set(B, 1 <= card), S=Prod(C, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20); MATHEMATICA a=Exp[Exp[x]-1]; Range[0, 20]! CoefficientList[Series[(a-1)^2, {x, 0, 20}], x] CROSSREFS Equals twice A000558. Cf. A001861, A008277. Sequence in context: A006646 A087635 A180038 * A215128 A190155 A025599 Adjacent sequences:  A052893 A052894 A052895 * A052897 A052898 A052899 KEYWORD easy,nonn AUTHOR encyclopedia(AT)pommard.inria.fr, Jan 25 2000 EXTENSIONS New name using e.g.f., Vaclav Kotesovec, Nov 20 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 22:20 EDT 2019. Contains 327252 sequences. (Running on oeis4.)