3024000

Appears in sequences

• a(n) = Bernoulli(2*n) * (2*n + 1)!.at n=5A001332
• Expansion of e.g.f. (1 - 2*x - sqrt(1-4*x))^2 * (1 - sqrt(1-4*x))/8.at n=8A052722
• Expansion of e.g.f. log((-1+x)/(-1+x+x^2)).at n=9A052832
• For n >= 1, a(n) is the number of permutations in the symmetric group S_n such that their cycle decomposition contains no 6-cycle.at n=10A060726
• Numbers k such that sigma(k) - usigma(k) > 3k.at n=16A063875
• Triangle T(n,k) generalizing the tangent numbers.at n=19A064190
• Triangle read by rows: T(n,k) is the number of n-bead necklaces with exactly k different colored beads.at n=52A087854
• Denominator of Sum_{i=1..n} 1/(i^3*C(2*i,i)).at n=5A112103
• a(n) = Bernoulli(n) * (n+1)!.at n=10A129814
• a(n) = n!*Bernoulli(n-1), n > 2; a(0)=0, a(1)=1, a(2)=1.at n=11A129825
• Transformed Bernoulli twin numbers.at n=10A129826
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} for which k is the maximal number of initial odd entries (0 <= k <= ceiling(n/2)).at n=44A152662
• Number of leading odd entries in all permutations of {1,2,...,n} (see example).at n=9A152663
• Number of leading even entries in all permutations of {1,2,...,n}.at n=9A152665
• Triangle read by rows, based on expansion of (x^2/(exp(x)-1))^m = x^m+sum(n>m T(n,m)*m!/((n-m)!*n!)*x^n).at n=55A191578
• Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of permutations of [1..n] in which none of the cycle lengths are divisible by k.at n=50A213280
• Triangle T(n,k) giving denominator of coefficient of x^k in a polynomial p(n) defined as a determinant.at n=13A233472
• Number of primitive (=aperiodic) n-bead necklaces with colored beads of exactly 8 different colors.at n=2A254080
• Triangle read by rows: number of idempotent basis elements of rank k in Brauer monoid B_n.at n=59A256041
• E.g.f. satisfies: A(x) = Integral 1 + A(x)^5 dx.at n=2A258925