|
%I #26 Oct 14 2020 15:13:31
%S 1,1,1,4,9,96,145,4320,11025,179200,693441,36288000,62610625,
%T 5748019200,15259154625,378002200576,4108830350625,334764638208000,
%U 643373556450625,115242726703104000,309281197713168681,14870534508544000000,168541849294187630625
%N a(n) = n! * [x^n] exp(Sum_{k=1..n, gcd(n,k) = 1} x^k / k).
%C Number of permutations of [n] whose cycle lengths are relatively prime to n.
%H Alois P. Heinz, <a href="/A335088/b335088.txt">Table of n, a(n) for n = 0..450</a>
%p b:= proc(n, m) option remember; `if`(n=0, 1, add(`if`(
%p igcd(j, m)=1, b(n-j, m), 0)*(n-1)!/(n-j)!, j=1..n))
%p end:
%p a:= n-> b(n$2):
%p seq(a(n), n=0..23); # _Alois P. Heinz_, Oct 12 2020
%t Table[n! SeriesCoefficient[Exp[Sum[Boole[GCD[n, k] == 1] x^k/k, {k, 1, n}]], {x, 0, n}], {n, 0, 22}]
%Y Cf. A074759, A226388, A335797.
%K nonn
%O 0,4
%A _Ilya Gutkovskiy_, Oct 12 2020
|
