235200

Appears in sequences

• a(n) = Catalan(n) * Product_{k = 0..n-1} a(k).at n=5A003047
• C_{n+1}*C_n*C_{n-1}^2*C_{n-2}^4*...*C_2^{2^(n-2)}, where C_k are the Catalan numbers (A000108).at n=4A028580
• Expansion of e.g.f.: -(log(1-x))^5.at n=8A052767
• Number of nested algorithms a(m,n) where m is the number of items in a contaminated group and n is the total number of unclassified items (0 <= m <= n) (values read by antidiagonals).at n=11A055633
• Number of nested algorithms a(m,n) where m is the number of items in a contaminated group and n is the total number of unclassified items (0 <= m <= n) (values read by antidiagonals).at n=18A055633
• n*(n+1)^2*(n+2)*(n+3)^2*(n+4).at n=4A057666
• Max_{k=0..n} k!*|Stirling1(n,k)|.at n=8A058583
• Denominator(Sum_{i=1..n} 1/i^3)/denominator(Sum_{i=1..n} 1/i).at n=7A068589
• Coefficients of certain polynomials (rising powers).at n=31A075181
• a(n) = n^2*(n+1)*(2*n+1)/3.at n=23A098077
• Gives the i-th coefficient M(k,i) of the decomposition of the polynomials B(k,X^2) in the basis of all B(i,X), where B(i,X) is the i-th binomial polynomial: B(i,X) = X(X-1)...(X-i+1)/i! for any i > 0 and B(0,X) = 1 by definition.at n=32A100344
• Square array T(n,k) read by antidiagonals: denominators of Stirling numbers of first kind with negative argument S1(-n,k), n,k>=0.at n=37A103880
• Triangle of coefficients of q in e.g.f. that satisfies: A(x,q) = exp( q*x*A(q*x,q) ), read by rows of [n*(n-1)/2 + 1] terms in row n for n>=0.at n=81A126265
• a(n) = (n^6 - 30*n^4 + 45*n^3 + 206*n^2 - 576*n + 384)/6.at n=9A135917
• Irregular triangle T(n,k) = binomial(n-1,m-1)*m!*A036040(n,k), where m=A036043(n,k), read by rows, 1 <= k <= A000041(n).at n=56A181417
• Molecular topological indices of the cocktail party graphs.at n=24A181773
• 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=10A219192
• Ordered products of the perimeter and the sides of primitive Pythagorean triangles.at n=3A223857
• Triangle read by rows, the ordered Stirling cycle numbers, T(n, k) = k!* s(n, k); n >= 0 k >= 0.at n=41A225479
• Composite numbers m such that Sum_{i=1..k} (p_i/(p_i+1)) - Product_{i=1..k} (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=29A230111