50568
domain: N
Appears in sequences
- Number of labeled rooted trees of height 2 with n nodes.at n=5A000551
- Expansion of {Product_{j>=1} (1 - (-x)^j) - 1}^12 in powers of x.at n=17A001490
- Triangle read by rows giving number of rooted labeled trees with n >= 2 nodes and height d >= 1.at n=22A034855
- a(n) = 18n^3 + 6n^2.at n=14A087887
- G.f.: A(x) = ( G(x)^5 - G(x^5) - 5*x*((1-x^4)/(1-x))/(1-x^5) )/(25*x^2) where G(x) is the g.f. of A110631.at n=20A111583
- a(n) = (n^2 + 4*n + 6) * n^2.at n=14A258402
- Number of 7-digit numbers whose sum of digits is n.at n=15A278969
- Number of 7-digit numbers whose sum of digits is n.at n=47A278969
- Solutions k of the equation isigma(k) = isigma(k-1) + isigma(k-2) where isigma(k) is the sum of the infinitary divisors of k (A049417).at n=6A332975
- a(n) = F(n) * (2*F(n-1)^2 + (-1)^(n-1)) * (2*F(n)^2 + (-1)^n), where F(n) is the n-th Fibonacci number.at n=6A350901