|
%I #24 Feb 09 2018 11:02:57
%S 1,1,2,10,762,1876255,274382326290,3265588553925722827,
%T 4299566944396584777543664576,828675148077536475804944305151462053905,
%U 30068353582978459601855528390398866877243129478172220
%N Number of multisets of n permutations of [n] with the symmetric group acting on the permutation elements.
%C The Harary and Palmer text has the generic formulas for power group enumeration.
%C a(n) is also the number of preference profiles with n alternatives and n agents (IANC model). Egecioglu (2009) contains a general formula. - _Alexander Karpov_, Dec 15 2017
%D F. Harary and E. Palmer, Graphical Enumeration, Academic Press, NY, 1973.
%H Ö. Egecioglu, <a href="https://www.cs.ucsb.edu/research/tech-reports/2005-25">Uniform generation of anonymous and neutral preference profiles for social choice rules</a>, UC Santa Barbara Report 2005-25.
%H Ö. Egecioglu, <a href="https://doi.org/10.1515/MCMA.2009.014">Uniform generation of anonymous and neutral preference profiles for social choice rules</a>, Monte Carlo Methods and Applications, 15(3), Jan 2009, 241-255.
%H Marko R. Riedel, <a href="http://math.stackexchange.com/questions/799707/">Combinatorial counting with symmetry</a>
%H Marko Riedel, <a href="/A263921/a263921.maple.txt">Maple implementation of Power Group Enumeration</a>
%K nonn
%O 0,3
%A _Marko Riedel_, Oct 29 2015
| 