Sequences
392,541 sequences
- a(n) = 3!*n*S(n-1,3), where S denotes the Stirling numbers of second kind.A052761
a(n) = 3!*n*S(n-1,3), where S denotes the Stirling numbers of second kind.
- Products of 4 consecutive integers: a(n) = n*(n-1)*(n-2)*(n-3).A052762
Products of 4 consecutive integers: a(n) = n*(n-1)*(n-2)*(n-3).
- Number of rooted trees with n nodes and 4-colored non-root nodes.A052763
Number of rooted trees with n nodes and 4-colored non-root nodes.
- E.g.f.: -1/4*LambertW(-4*x).A052764
E.g.f.: -1/4*LambertW(-4*x).
- Expansion of e.g.f.: -x^2*(log(1-x))^3.A052765
Expansion of e.g.f.: -x^2*(log(1-x))^3.
- Expansion of e.g.f.: (log(1-x))^2*x^3.A052766
Expansion of e.g.f.: (log(1-x))^2*x^3.
- Expansion of e.g.f.: -(log(1-x))^5.A052767
Expansion of e.g.f.: -(log(1-x))^5.
- a(n) = n*(n-1)*(n-2)*(n-3) for n>=5.A052768
a(n) = n*(n-1)*(n-2)*(n-3) for n>=5.
- E.g.f.: x^3*(exp(x)-1)^2.A052769
E.g.f.: x^3*(exp(x)-1)^2.
- Expansion of e.g.f. log(-1/(-1+x))^4*x.A052770
Expansion of e.g.f. log(-1/(-1+x))^4*x.
- E.g.f.: x^3*exp(x)^2.A052771
E.g.f.: x^3*exp(x)^2.
- Number of rooted identity trees with n nodes and 4-colored non-root nodes.A052772
Number of rooted identity trees with n nodes and 4-colored non-root nodes.
- A simple grammar.A052773
A simple grammar.
- a(n) = (4*n+1)^(n-1).A052774
a(n) = (4*n+1)^(n-1).
- G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^k)^4 * x^k / k ).A052775
G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^k)^4 * x^k / k ).
- a(n) = 4!*n*Stirling2(n-1,4).A052776
a(n) = 4!*n*Stirling2(n-1,4).
- E.g.f.: x^2*(exp(x)-1)^3.A052777
E.g.f.: x^2*(exp(x)-1)^3.
- E.g.f.: x^4*log(-1/(-1+x)).A052778
E.g.f.: x^4*log(-1/(-1+x)).
- Expansion of e.g.f.: (log(1-x))^6.A052779
Expansion of e.g.f.: (log(1-x))^6.
- Expansion of e.g.f. x^2*exp(4*x).A052780
Expansion of e.g.f. x^2*exp(4*x).
- G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} A(x^k)^5 * x^k / k ).A052781
G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} A(x^k)^5 * x^k / k ).
- a(n) = (5*n+1)^(n-1).A052782
a(n) = (5*n+1)^(n-1).
- Expansion of e.g.f. x*log(-1/(-1+x))^5.A052783
Expansion of e.g.f. x*log(-1/(-1+x))^5.
- Expansion of e.g.f.: x^3*(exp(x)-1)^3.A052784
Expansion of e.g.f.: x^3*(exp(x)-1)^3.
- a(n) = 5!*n*Stirling2(n-1, 5).A052785
a(n) = 5!*n*Stirling2(n-1, 5).
- Expansion of e.g.f.: -x^3*(log(1-x))^3.A052786
Expansion of e.g.f.: -x^3*(log(1-x))^3.
- Product of 5 consecutive integers.A052787
Product of 5 consecutive integers.
- Number of rooted trees with n nodes and 5-colored non-root nodes.A052788
Number of rooted trees with n nodes and 5-colored non-root nodes.
- Expansion of e.g.f. -(1/5)*LambertW(-5*x).A052789
Expansion of e.g.f. -(1/5)*LambertW(-5*x).
- Expansion of e.g.f.: x^2*log(1-x)^4.A052790
Expansion of e.g.f.: x^2*log(1-x)^4.
- 3^(n-3)*n*(n-1)*(n-2).A052791
3^(n-3)*n*(n-1)*(n-2).
- Expansion of e.g.f.: x^2*(exp(x)-1)^4.A052792
Expansion of e.g.f.: x^2*(exp(x)-1)^4.
- Expansion of e.g.f. x^4*exp(x)^2 - 2*x^4*exp(x) + x^4.A052793
Expansion of e.g.f. x^4*exp(x)^2 - 2*x^4*exp(x) + x^4.
- E.g.f.: -x^5*log(1-x).A052794
E.g.f.: -x^5*log(1-x).
- a(n) = (6*n)!/(5*n+1)!.A052795
a(n) = (6*n)!/(5*n+1)!.
- Expansion of e.g.f. x^4*exp(x)^2.A052796
Expansion of e.g.f. x^4*exp(x)^2.
- Number of rooted identity trees with n nodes and 5-colored non-root nodes.A052797
Number of rooted identity trees with n nodes and 5-colored non-root nodes.
- G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^k)^5 * x^k / k ).A052798
G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^k)^5 * x^k / k ).
- Expansion of e.g.f.: x^4*(log(1-x))^2.A052799
Expansion of e.g.f.: x^4*(log(1-x))^2.
- E.g.f.: x^5*exp(x)-x^5.A052800
E.g.f.: x^5*exp(x)-x^5.
- A simple grammar: labeled pairs of sequences of cycles.A052801
A simple grammar: labeled pairs of sequences of cycles.
- E.g.f. satisfies A(x) = 1/(1 + log(1 - x*A(x))).A052802
E.g.f. satisfies A(x) = 1/(1 + log(1 - x*A(x))).
- Expansion of e.g.f. (-1 + sqrt(1 + 4*log(1-x)))/(2*log(1-x)).A052803
Expansion of e.g.f. (-1 + sqrt(1 + 4*log(1-x)))/(2*log(1-x)).
- A simple grammar: cycles of rooted cycles.A052804
A simple grammar: cycles of rooted cycles.
- If B is a collection in which there are C(n-1) [Catalan numbers, A000108] things with n points, a(n) is the number of subsets without repetition of B with a total of n points.A052805
If B is a collection in which there are C(n-1) [Catalan numbers, A000108] things with n points, a(n) is the number of subsets without repetition of B with a total of n points.
- Number of sequences of rooted identity trees with a total of n nodes.A052806
Number of sequences of rooted identity trees with a total of n nodes.
- Expansion of e.g.f. -LambertW(log(1-x)).A052807
Expansion of e.g.f. -LambertW(log(1-x)).
- E.g.f.: -log(1-x+log(1-x)).A052808
E.g.f.: -log(1-x+log(1-x)).
- A simple grammar: number of cycles of cycles.A052809
A simple grammar: number of cycles of cycles.
- a(n) = 1 + (number of partitions of n, n>0).A052810
a(n) = 1 + (number of partitions of n, n>0).