45920
domain: N
Appears in sequences
- a(n) = binomial(2*n,n) mod ((n+1)*(n+2)*(n+3)).at n=38A065345
- One-sixth of the area of some primitive Heronian triangles with a distance of 2n+1 between the median and altitude points on the longest side.at n=8A074076
- Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k nonroot nodes of degree 1.at n=40A101449
- Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k branches.at n=40A101452
- Self-convolution omits 1's at positions of triangular numbers less one.at n=30A105613
- Self-convolution of A105613.at n=23A105614
- Special values of hypergeometric function of type 3F3: a(n)=2^n*(n!)^3* 3F3(n+1, n+1, n+1; 1, 1, 1; 2)*exp(-2), n=0,1...at n=2A127457
- Row sums from A144562.at n=34A144640
- a(n) = 8*a(n-1) + 6*a(n-2), with a(0)=0, a(1)=1.at n=6A190560
- Molecular topological index of the Andrásfai graphs.at n=13A192790
- Number of 0..n arrays x(0..4) of 5 elements with each no smaller than the sum of its two previous neighbors modulo (n+1).at n=12A207102
- a(n) = 2*n*(n+1)*(n+2)/3.at n=40A210440
- Number of nonisomorphic proper colorings of partition multicycle graph using six colors.at n=76A298266
- a(n) is the next number after a(n-1) which cannot be represented in the form 2*a(i) and Sum_{j=1..n-1} b_j*a(j) where 0 < i < n, b_j = 1 or 0. The sequence starts: a(1) = 1; a(2) = 2; a(3) = 3; a(4) = 5.at n=18A331811
- Partial sums of the even triangular numbers (A014494).at n=40A352115
- G.f. A(x) satisfies: x = Sum_{n=-oo..+oo} (-x)^n * (1 + A(x)*x^n)^n.at n=11A355869
- a(n) = Sum_{k=1..n} k^2*sigma_2(k), where sigma_2 is A001157.at n=10A364268
- Expansion of e.g.f. exp(x^3/(6 * (1 - x)^2)).at n=8A373757