940800

Appears in sequences

• Triangle of number of labeled rooted trees with n nodes and k leaves, n >= 1, 1 <= k <= n.at n=30A055302
• Number of labeled rooted trees with n nodes and 3 leaves.at n=4A055304
• a(n) = (5*n+1)*(5*n+3)*(5*n+5).at n=19A079610
• Matrix square of unsigned Lah triangle abs(A008297(n,k)) or A105278(n,k).at n=31A079621
• Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).at n=31A086915
• Bisection of A002417.at n=23A100431
• Partition number array, called M31(4), related to A049352(n,m)= |S1(4;n,m)| (generalized Stirling triangle).at n=47A144354
• A partition product of Stirling_1 type [parameter k = -4] with biggest-part statistic (triangle read by rows).at n=33A157384
• Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^6 = I.at n=7A163924
• a(n) = 98*a(n-1) - 2*a(n-2); a(1) = 0, a(2) = 1.at n=4A168522
• Area A of the bicentric quadrilaterals such that A, the sides, the radius of the circumcircle and the radius of the incircle are integers.at n=24A219192
• Triangle read by rows: T(n,k) are the coefficients of the Lagrange (compositional) inversion of a function in terms of the Taylor series expansion of its reciprocal, n >= 1, k = 1..A000041(n-1).at n=50A248927
• Triangle read by rows: T(n,k) (n>=1, 3<=k<=n+2) is the number of k-sequences of balls colored with n colors such that exactly two balls are of a color seen previously in the sequence.at n=32A281944
• Triangle read by rows where T(n,k), n>=1, 1<=k<=n is the number of (0,1)-matrices of size n with the first row and column sum = k and remaining sums = 1.at n=38A308498
• Numbers k such that A051378(k) > 2*k and A333926(k) <= 2*k.at n=14A349284
• Triangle of numbers T(n,k) = (-1)^(n-k)*(n+1)!*Stirling2(n,k)/(k+1).at n=25A356857