Sequences
392,541 sequences
- A simple grammar: sequences of pairs of cycles.A052811
A simple grammar: sequences of pairs of cycles.
- A simple grammar: power set of pairs of sequences.A052812
A simple grammar: power set of pairs of sequences.
- Expansion of e.g.f.: LambertW(log(1-x))/log(1-x).A052813
Expansion of e.g.f.: LambertW(log(1-x))/log(1-x).
- A simple grammar.A052814
A simple grammar.
- Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.A052815
Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.
- Expansion of g.f. (1+x)*Product_{m>0} (1 + x^m).A052816
Expansion of g.f. (1+x)*Product_{m>0} (1 + x^m).
- Cycles of rooted trees t where for each t all subtrees at root are distinct. n is total number of nodes.A052817
Cycles of rooted trees t where for each t all subtrees at root are distinct. n is total number of nodes.
- Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.A052818
Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.
- E.g.f. equals the series reversion of x + x*log(1-x).A052819
E.g.f. equals the series reversion of x + x*log(1-x).
- Expansion of e.g.f. 1/(1 - x + log(1 - x)).A052820
Expansion of e.g.f. 1/(1 - x + log(1 - x)).
- A simple grammar: pairs of cycles of sequences.A052821
A simple grammar: pairs of cycles of sequences.
- A simple grammar: pairs of cycles of cycles.A052822
A simple grammar: pairs of cycles of cycles.
- A simple grammar: cycles of pairs of sequences.A052823
A simple grammar: cycles of pairs of sequences.
- A simple grammar: cycles of pairs of cycles.A052824
A simple grammar: cycles of pairs of cycles.
- A simple grammar: partial sums of A008965.A052825
A simple grammar: partial sums of A008965.
- A simple grammar: product of cycles and cycles of cycles.A052826
A simple grammar: product of cycles and cycles of cycles.
- a(n) is the number of unlabeled forests of rooted trees with n nodes such that no two trees are identical.A052827
a(n) is the number of unlabeled forests of rooted trees with n nodes such that no two trees are identical.
- A simple grammar: union of cycles and cycles of cycles.A052828
A simple grammar: union of cycles and cycles of cycles.
- A simple grammar: partial sums of A052870.A052829
A simple grammar: partial sums of A052870.
- A simple grammar: sequences of rooted cycles.A052830
A simple grammar: sequences of rooted cycles.
- A simple grammar.A052831
A simple grammar.
- Expansion of e.g.f. log((-1+x)/(-1+x+x^2)).A052832
Expansion of e.g.f. log((-1+x)/(-1+x+x^2)).
- Expansion of e.g.f.: (log(2-exp(x)))^2.A052833
Expansion of e.g.f.: (log(2-exp(x)))^2.
- a(n) = Bell(n+1)-Bell(n)-1, n>0.A052834
a(n) = Bell(n+1)-Bell(n)-1, n>0.
- E.g.f.: 1/(1+log(1-x))-log(1-x).A052835
E.g.f.: 1/(1+log(1-x))-log(1-x).
- INVERT transform of A052879.A052836
INVERT transform of A052879.
- Number of partitions of 2n whose Ferrers-Young diagram allows more than one different domino tiling.A052837
Number of partitions of 2n whose Ferrers-Young diagram allows more than one different domino tiling.
- Expansion of e.g.f.: (exp(x/(1-x)) - 1)^2.A052838
Expansion of e.g.f.: (exp(x/(1-x)) - 1)^2.
- Number of partitions of n into distinct summands (A000009), plus 1 (apart from the first term).A052839
Number of partitions of n into distinct summands (A000009), plus 1 (apart from the first term).
- a(n) = n*A029767(n-1).A052840
a(n) = n*A029767(n-1).
- Expansion of e.g.f.: 1/(exp(x)*(2-exp(x))).A052841
Expansion of e.g.f.: 1/(exp(x)*(2-exp(x))).
- E.g.f. A(x) = series reversion of (1-x)*(1-exp(-x)).A052842
E.g.f. A(x) = series reversion of (1-x)*(1-exp(-x)).
- a(n) is the number of forests with n nodes of rooted unlabeled identity trees.A052843
a(n) is the number of forests with n nodes of rooted unlabeled identity trees.
- E.g.f.: exp(x*(2-x)/(1-x)).A052844
E.g.f.: exp(x*(2-x)/(1-x)).
- Expansion of e.g.f.: exp(x^2/(1-x)).A052845
Expansion of e.g.f.: exp(x^2/(1-x)).
- E.g.f.: (1-exp(x))*log(2-exp(x)).A052846
E.g.f.: (1-exp(x))*log(2-exp(x)).
- G.f.: 1 / Product_{k>=1} (1-x^k)^(k-1).A052847
G.f.: 1 / Product_{k>=1} (1-x^k)^(k-1).
- Number of ordered set partitions with a designated element in each block and no block containing less than two elements.A052848
Number of ordered set partitions with a designated element in each block and no block containing less than two elements.
- a(0) = 0; a(n) = 2*n! (n >= 1).A052849
a(0) = 0; a(n) = 2*n! (n >= 1).
- E.g.f.: x/(1-x)+log((1-x)/(1-2*x)).A052850
E.g.f.: x/(1-x)+log((1-x)/(1-2*x)).
- Expansion of e.g.f. 1/2 - (1/2)*(1+4*log(1-x))^(1/2).A052851
Expansion of e.g.f. 1/2 - (1/2)*(1+4*log(1-x))^(1/2).
- Expansion of e.g.f.: (x/(1-x))*exp(x/(1-x)).A052852
Expansion of e.g.f.: (x/(1-x))*exp(x/(1-x)).
- A simple grammar.A052853
A simple grammar.
- Number of forests of ordered trees on n total nodes.A052854
Number of forests of ordered trees on n total nodes.
- Number of forests of rooted trees of nonempty sets with n points. (Each node is a set of 1 or more points.)A052855
Number of forests of rooted trees of nonempty sets with n points. (Each node is a set of 1 or more points.)
- E.g.f.: (1-3*exp(x)+exp(2*x))/(exp(x)-2).A052856
E.g.f.: (1-3*exp(x)+exp(2*x))/(exp(x)-2).
- A simple grammar. a(n)=n*A052873(n-1).A052857
A simple grammar. a(n)=n*A052873(n-1).
- Expansion of e.g.f. log(-1/(-1+x*exp(x)-x)).A052858
Expansion of e.g.f. log(-1/(-1+x*exp(x)-x)).
- Expansion of e.g.f.: exp(exp(2*x) - 2*exp(x) + 1).A052859
Expansion of e.g.f.: exp(exp(2*x) - 2*exp(x) + 1).
- A simple grammar: rooted sequences of cycles.A052860
A simple grammar: rooted sequences of cycles.