653184

Appears in sequences

• Number of permutations of an n-set containing a 5-cycle.at n=10A029572
• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*6^j.at n=33A038212
• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*6^j.at n=34A038212
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*2^j.at n=29A038256
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*2^j.at n=30A038256
• a(n) = (2n-1)*(2n-1)!/n.at n=4A052145
• Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.at n=29A054412
• Partial products of A079069.at n=10A078919
• Numbers n such that n=phi(phi(n)+sigma(n)) and n is not of the form 2*p where p is a Sophie Germain odd prime.at n=18A097652
• Triangle read by rows: T(n,k) is the number of permutations of n elements that have the longest cycle length k.at n=49A126074
• Bases and exponents in the prime decomposition of n replaced by composites with these indices.at n=27A141569
• Denominators of coefficients in Taylor series expansion of arccosh(exp(x)-sin(x)).at n=9A202359
• a(n) = 2^(2*n+1) * (2*n+1)*n^(2*n).at n=2A217971
• Triangle of number of functions in a size n set for which the sequence of composition powers ends in a length k cycle.at n=39A222029
• Number of n-permutations such that at least one cycle has size ceiling(n/2).at n=9A229244
• The greedy sequence of real numbers at least 1 that do not contain any 4-term geometric progressions with integer ratio.at n=32A235055
• n*n!/round(n/2).at n=8A256880
• Numbers m such that sigma(Product(p_j)) = sigma(Product(e_j)), where m = Product((p_i)^e_i) and sigma = A000203.at n=36A272859
• Number of elements of order n in the exceptional group G_2(3).at n=12A284925
• Number of endofunctions on [n] such that the LCM of their cycle lengths equals five.at n=8A291111