2570400

Appears in sequences

• Numbers k such that sigma(k) - usigma(k) > 3k.at n=10A063875
• Table (read by rows) giving the coefficients of sum formulas of n-th Factorials (A000142). The k-th row (k>=1, n>=2) contains T(i,k) for i=1 to k+1, where k=[2*n+1+(-1)^(n-1)]/4 and T(i,k) satisfies Fact(n) = Sum_{i=1..k+1} T(i,k) * (n-1)^(k-i+1) / (2*k-2)!.at n=13A101751
• Odd triangle n!. This table read by rows gives the coefficients of sum formulas of n-th Factorials (A000142). The k-th row (6>=k>=1) contains T(i,k) for i=1 to k+2, where k=[2*n+3+(-1)^n]/4 and T(i,k) satisfies n! = Sum_{i=1..k+2} T(i,k) * n^(i-1) / (2*k-2)!.at n=12A102410
• Kekulé numbers for certain benzenoids.at n=13A108680
• Triangle T(n, k) = n!*StirlingS2(n, k)/binomial(n, k), read by rows.at n=47A156815
• Numbers n such that there exists a pair x,y, where x<y, x! = n and y! = n, that makes {x,y,n,n} an amicable multiset.at n=6A273969