5443200
domain: N
Appears in sequences
- Denominators of expansion of -W_{-1}(-e^{-1-x^2/2}) where W_{-1} is Lambert W function.at n=7A005446
- a(1) = 1; a(n) = n!*(3/2) for n>=2.at n=9A070960
- a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1.at n=17A076929
- a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1.at n=18A076929
- Expansion of f(-q)^2*R(q) in powers of q.at n=11A122267
- a(n) = Product_{k=1..n, gcd(k,n)=1} (1+k).at n=14A131553
- Elements n of A141586 with property that A100762(n) = n.at n=30A141758
- Number of descents beginning with an even number and ending with an odd number in all permutations of {1,2,...,n}.at n=9A152887
- Triangle read by rows: T(n,m) = A094310(n,m)*A120070(n+1,m), 1 <= m <= n.at n=40A165969
- Triangle of numerators of coefficients of the polynomial Q^(2)_m(n) defined by the recursion Q^(2)_0(n)=1; for m>=1, Q^(2)_m(n) = Sum_{i=1..n} i^2*Q^(2)_(m-1)(i). For m>=0, the denominator for all 3*m+1 terms of the m-th row is A202367(m+1).at n=49A175669
- Triangular array read by rows: T(n,k) is the number of inversion pairs ( p(i) < p(j) with i>j ) that are separated by exactly k elements in all n-permutations (where the permutation is represented in one line notation); n>=2, 0<=k<=n-2.at n=42A202363
- LCM of denominators of the coefficients of polynomials Q^(2)_m(n) defined by the recursion Q^(2)_0(n)=1; for m >= 1, Q^(2)_m(n) = Sum_{i=1..n} i^2*Q^(2)_(m-1)(i).at n=4A202367
- Triangle read by rows: terms T(n,k) of a binomial decomposition of n as Sum(k=0..n)T(n,k).at n=42A244133
- Signed denominators of the reduced form of the coefficients of degree 2n terms of the Maclaurin series of (t/sinh(t))^x in t.at n=4A262179
- Number of n X 2 arrays containing 2 copies of 0..n-1 with row sums equal and column sums equal.at n=9A265086
- Number of ways to arrange n women and n men around a circular table so that they can be divided into n nonintersecting pairs of 1 woman and 1 man sitting side-by-side.at n=6A273935
- Denominators of coefficients in expansion of 1/(1 + 2 cos(sqrt(x))).at n=5A279121
- a(n) is the smallest integer that can be written as a product of n distinct integers > 1 in at least two different ways.at n=7A340727
- Numbers k such that A384655(k)/k > A384655(m)/m for all m < k.at n=37A384659