|
%I #13 May 03 2019 21:36:59
%S 1,1,1,6,144,13440,4976640,7390494720,44033145569280,
%T 1050540969012756480,100246620373125798297600,
%U 38247242364455762072803737600,58346834889692144013481754807500800,355946631376225773365104516210274756198400
%N Number of narcissistic group-separable preference profiles.
%H A. Karpov, <a href="https://doi.org/10.1007/s10726-019-09621-w">On the Number of Group-Separable Preference Profiles</a>, Group Decision and Negotiation, 2019, pp. 1-17.
%F a(n) = Sum_{k=1..n-1} binomial(n-1, k-1)*2^(2*n*k-2*k^2-n)*a(k)*a(n-k).
%o (PARI) a(n) = {j=1;if(n>1,j=sum(k=1,n-1,binomial(n-1, k-1)*2^(2*n*k-2*k^2-n)*a(k)*a(n-k)));j;} \\ _Jinyuan Wang_, Apr 08 2019
%K nonn
%O 0,4
%A _Alexander Karpov_, Apr 07 2019
%E More terms from _Jinyuan Wang_, Apr 08 2019
|
