630630

Appears in sequences

• Triangle read by rows: T(n, k) = binomial(n, k) * binomial(n+k, n-k).at n=48A092371
• a(n) = binomial(n+6,6) * binomial(n+10,6).at n=4A103604
• a(n) = binomial(n+4,n)*binomial(n+8,n).at n=6A105251
• Numbers m that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (m raised to k+1 must not be a multiple). Case k=15.at n=16A135200
• Triangle read by rows: T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and with exactly 1 fixed point.at n=40A144090
• Numbers with exactly 6 distinct prime divisors {2,3,5,7,11,13}.at n=18A147573
• Triangle where the g.f. for row n equals d^n/dx^n (1+x+x^2)^n / n! for n>=0, as read by rows.at n=49A220178
• Denominators of Integral_{x=0..Pi/2} sin(2*n*x)*log(cosec(x)) dx.at n=14A225123
• Triangle read by rows: T(n,k) (n>=2, 1<=k<=n-1) is the number of unordered pairs of vertices at distances k in the odd graph O_n.at n=23A228308
• a(n) = f(3*n)/(f(n-1)*f(n)*f(n+1)), where f(k) = k!.at n=4A248707
• Irregular triangle read by rows in which the n-th row lists multinomials (A036040) for partitions of 2n which have only even parts in Abramowitz-Stegun ordering.at n=38A257490
• G.f. A(x,y) satisfies: A(x,y) + A(1/x,y) = Sum_{m>=0} (x^m + y + 1/x^m)^m, ignoring the infinite constant term; this is the triangle, read by rows, of coefficients T(n,k) of x^n*y^k in A(x,y) for n >= 1, k = 0..n-1.at n=109A316590
• G.f. A(x,y) satisfies: A(x,y) + A(1/x,y) = Sum_{m>=0} (x^m + y + 1/x^m)^m, ignoring the infinite constant term; this is the triangle, read by rows, of coefficients T(n,k) of x^n*y^k in A(x,y) for n >= 1, k = 0..n-1.at n=111A316590
• Partition triangle read by rows. Number of ordered set partitions of the set {1, 2, ..., 2*n} with all block sizes divisible by 2.at n=37A327022
• a(n) = ((n+1)^2 - 2) * binomial(2*n-2,n-1) / 2.at n=9A349427
• a(n) = Fibonacci(n)^2 * Catalan(n).at n=8A373614
• a(n) = denominator( (1/(4*n + 2))*Sum_{i=0..2*n} (-1)^i/(2*i+1) ).at n=3A392686