270576

Appears in sequences

• a(n) = n!*(1 - 1/2 + 1/3 - ... + c/n), where c = (-1)^(n+1).at n=8A024167
• Triangle formed from expansion of (x-1)*(x+2)*(x-3)*...*(x+-n).at n=53A047991
• Triangle T(n,k) read by rows giving coefficients in expansion of n! * Sum_{i=0..n} C(x,i) in descending powers of x.at n=53A054651
• Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.at n=17A057545
• Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp(x*y)*log(1+x)/(1-x).at n=36A073480
• Square array of coefficients of binomial polynomials, read by antidiagonals.at n=44A080959
• Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A071667/A071668.at n=17A089878
• a(n) = n! * Sum_{k=ceiling(n/2)..n} 1/k.at n=8A101611
• Triangle read by rows: coefficients of the alternating factorial polynomial (x+1)(x-2)(x+3)(x-4)...(x+n*(-1)^(n-1)).at n=46A140956
• Coefficient array of numerator polynomials of the ordinary generating functions for the alternating sums of powers for the numbers 1,2,...,2*n+1.at n=24A196848
• Triangle read by rows: T(n,k) = numerators of "across the board" style tournament payouts.at n=40A388733
• Triangle read by rows: T(0,0) = 1, T(n,0) = 0 for n > 0; T(n,k) = (1/(k-1)!) * Sum_{j=k..n} binomial(n,j) * Stirling1(j,k) * (n-j+k-1)!, 0 <= k <= n.at n=46A389008