|
Search: id:A102866
|
|
|
| A102866 |
|
Number of finite languages over a binary alphabet (set of binary words of total length n). |
|
+0
2
|
|
| 1, 2, 5, 16, 42, 116, 310, 816, 2121, 5466, 13937, 35248, 88494, 220644, 546778, 1347344, 3302780, 8057344, 19568892, 47329264, 114025786, 273709732, 654765342, 1561257968, 3711373005, 8797021714, 20794198581, 49024480880
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Analogous to A034899 (which also enumerates multisets of words)
|
|
LINKS
|
P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 64
|
|
FORMULA
|
GF: exp(Sum((-1)^(j-1)/j*(2*z^j)/(1-2*z^j), j=1..infinity)):
|
|
EXAMPLE
|
a(2)=5 because the sets are {a,b}, {aa}, {ab}, {ba}, {bb};
a(3)=16 because the sets are {a,aa}, {a,ab}, {a,ba}, {a,bb}, {b,aa}, {b,ab}, {b,ba}, {b,bb}, {aaa}, {aab}, {aba}, {abb}, {baa}, {bab}, {bba}, {bbb}
|
|
MAPLE
|
series(exp(add((-1)^(j-1)/j*(2*z^j)/(1-2*z^j), j=1..40)), z, 40);
|
|
CROSSREFS
|
Cf. A034899.
Adjacent sequences: A102863 A102864 A102865 this_sequence A102867 A102868 A102869
Sequence in context: A124720 A076958 A163825 this_sequence A148368 A148369 A148370
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Philippe Flajolet (Philippe.Flajolet(AT)inria.fr), Mar 01 2005
|
|
|
Search completed in 0.002 seconds
|
