479001601

Appears in sequences

• Number of permutations of length n with equal cycles.at n=12A005225
• a(n) = n! + 1.at n=12A038507
• a(n) = (prime(n) - 1)! + 1.at n=5A060371
• a(n) = (-1)^(p-1)*(p-1)! + 1 where p = prime(n).at n=5A062411
• Number of degree-n permutations of order dividing n. Number of solutions to x^n = 1 in S_n.at n=13A074759
• a(n) = Sum_{d|n} (n-1)!/(d-1)!.at n=12A087906
• a(n) = Sum_{d divides n} (-1)^(n-d)*Stirling1(n,d).at n=12A096308
• a(n) = smallest composite which is > n! and is coprime to n!.at n=12A118069
• a(n) = (2n)! + 1.at n=6A127231
• a(n) = n!*Sum_{d|n} (-1)^(d+1)/(d!*(n/d)^d).at n=12A132960
• Smallest positive integer of the form (m!+n)/n.at n=12A139148
• a(n) = A136156(n) + 1.at n=12A139170
• Row sums of absolute values of A182928.at n=12A182926
• Row sums of A182928.at n=12A182927
• Expansion of e.g.f. exp(x)+log(1/(1-x)).at n=13A185387
• Triangular array read by rows: T(n,k) is the number of n-permutations that have exactly k distinct cycle lengths.at n=32A218868
• a(n) = Sum_{d|n} pxi(d), where pxi(m) is the product of totatives of m (A001783).at n=12A280258
• a(n) = Sum_{d|n} (-1)^(n/d+1) * (n-1)!/(d-1)!.at n=12A352013
• a(n) = Sum_{d|n} (d-1)!.at n=12A358280
• a(n) = Sum_{d|n} (d + n/d - 2)!/(d - 1)!.at n=12A358410