813960
domain: N
Appears in sequences
- Number of partitions of an n-gon into (n-5) parts.at n=6A002060
- Partial sums of A050406.at n=14A052254
- Triangle of coefficients, read by rows, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x) - x^2/(1-x)^3 + xy*f(x,y)^3.at n=52A086632
- Triangle read by rows, where the g.f. satisfies A(x, y) = 1 + x*A(x, y)^2 + x*y*A(x, y)^3.at n=41A104978
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k peaks of the form Ud.at n=39A108426
- Binet's factorial series. Denominators of the coefficients of a convergent series for the logarithm of the Gamma function.at n=16A122253
- Triangle T(n, k) = (binomial(n,2))! / (k! * abs(k+1 - binomial(n,2))!), read by rows.at n=27A123146
- A triangle of coefficients: T(n,m) = (2*n + 2*m + 3)! / (2*(2*m + 1)!*(2*n + 1)!).at n=24A143083
- Triangle T(n, k) = (2*n+1)!! * 2^(floor((n-1)/2) + floor(k/2) + 1) * Beta(floor(n/2) + floor((k-1)/2) + 2, floor((n-1)/2) + floor(k/2) + 2), read by rows.at n=41A158868
- Numbers with prime factorization pqrst^2u^3.at n=13A190390
- Number of ways to place 3 points on a triangular grid of side n so that they are not vertices of an equilateral triangle of any orientation.at n=17A240440
- Cayley's triangle of V numbers; triangle V(n,k), n >= 4, n <= k <= 2*n-4, read by rows.at n=51A259476
- a(n) = lcm{1,2,...,n} / binomial(n,floor(n/2)).at n=41A263673
- Number of 2 X 2 matrices with entries in {0,1,...,n} and odd trace with no elements repeated.at n=36A279905
- a(n) is the denominator of the n-th hyperharmonic number of order n.at n=20A354895
- Triangle read by rows. T(n, k) = (1/2) * C(n, k) * C(3*n - 1, n) for n > 0 and T(0, 0) = 1.at n=30A360560
- Triangle read by rows. T(n, k) = (1/2) * C(n, k) * C(3*n - 1, n) for n > 0 and T(0, 0) = 1.at n=33A360560
- a(n) = 55440 * (3*n)!/((2*n)!*(n+4)!).at n=7A361039
- Numbers that occur exactly 4 times in A036038, i.e., numbers m such that the multinomial coefficient (x_1 + ... + x_k)!/(x_1! * ... * x_k!) is equal to m for exactly 4 integer partitions (x_1, ..., x_k).at n=26A376374
- 3rd diagonal (from right) in A104978.at n=5A383451