|
%I #28 Oct 14 2020 14:51:30
%S 1,1,1,4,5,51,7,876,457,7678,5271,678569,10705,27644436,5060161,
%T 133924576,197920145,82864869803,173283535,5832742205056,98269310261,
%U 34660429169122,25313714237505,44152005855084345,13685698802401,2410161938206898126,129066382491033573
%N a(n) = n! * [x^n] exp(Sum_{k=1..n, gcd(n,k) = 1} x^k / k!).
%C Number of set partitions of [n] into blocks that are relatively prime to n.
%H Alois P. Heinz, <a href="/A335797/b335797.txt">Table of n, a(n) for n = 0..576</a>
%p b:= proc(n, m) option remember; `if`(n=0, 1, add(`if`(
%p igcd(j, m)=1, b(n-j, m), 0)*binomial(n-1, j-1), j=1..n))
%p end:
%p a:= n-> b(n$2):
%p seq(a(n), n=0..27); # _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, 26}]
%Y Cf. A057562, A275429, A335088.
%K nonn
%O 0,4
%A _Ilya Gutkovskiy_, Oct 12 2020
|
