54432000
domain: N
Appears in sequences
- a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1.at n=19A076929
- a(n) = denominator of Sum_{k=1..n} 1/k^(n+1-k).at n=6A130426
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k adjacent pairs of the form (even,even) (0<=k<=floor(n/2)-1).at n=33A145892
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k adjacent pairs of the form (even,even) (0<=k<=floor(n/2)-1).at n=36A145892
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k runs of odd entries (1<=k<=ceiling(n/2)). For example, the permutation 321756498 has 3 runs of odd entries: 3, 175 and 9.at n=37A152666
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k runs of even entries (n >= 2, 1 <= k <= floor(n/2)). For example, the permutation 321756498 has 3 runs of even entries: 2, 64 and 8.at n=31A152667
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k runs of even entries (n >= 2, 1 <= k <= floor(n/2)). For example, the permutation 321756498 has 3 runs of even entries: 2, 64 and 8.at n=34A152667
- Number of descents beginning and ending with an odd number in all permutations of {1,2,...,n}.at n=10A152885
- Number of descents beginning with an even number and ending with an odd number in all permutations of {1,2,...,n}.at n=10A152887
- Denominators of minimum possible graph likelihood for a graph on n nodes.at n=6A234235
- Partial products of A001783.at n=7A280821
- a(n) = n*a(n-1) + n!, with n>0, a(0)=5.at n=10A282466
- E.g.f.: Product_{m>0} (1+x^m+x^(2*m)/2!).at n=10A293138
- Triangle read by rows: binomial(n,k)*(2*n-k)!, n>=0, 0<=k<=n.at n=23A328826
- Primitive terms of A363063.at n=12A363098
- Numbers that set records in in A379772.at n=31A379773