21794572800
domain: N
Appears in sequences
- a(n) = n! / d(n), where d(n) is the number of divisors of n.at n=13A062358
- Let m be the product of the decimal digits in n, then a(n) = 0 if m = 0, otherwise a(n) = n!/m.at n=13A067455
- For n > 0, 0 <= k <= n^2, T(n,k) is the number of rotationally and reflectively distinct n X n arrays that contain the numbers 1 through k once each and n^2-k zeros.at n=28A087074
- Second column (k=3) of array A090438 ((4,2)-Stirling2) divided by 8.at n=5A091032
- a(n) = n!/A124901(n).at n=10A124903
- a(2) = 1, a(3)=3; for n >= 4, a(n) = (n-2)!*Stirling_2(n,n-1)/2 = n!/4.at n=12A133799
- Duplicate of A124903.at n=10A197954
- E.g.f.: exp(x^3/(1 + x + x^2 + x^3)).at n=14A293590
- T(n, k) = Sum_{j=0..k} (-1)^j*binomial(2*k, j)*(k - j)^(2*n), triangle read by rows, n >= 0 and 0 <= k <= n.at n=34A304330
- Write 1/(1 + sin x) = Product_{n>=1} (1 + f_n x^n); a(n) = denominator(f_n).at n=13A328186
- Expansion of e.g.f. sinh(2 * log(1+x)) / 2.at n=13A357599
- Expansion of e.g.f. exp(x^3 * (1 + x)).at n=14A376513