cp's OEIS Frontend

A263921 Number of multisets of n permutations of [n] with the symmetric group acting on the permutation elements.

%I A263921 #33 May 22 2025 10:56:32
%S A263921 1,1,2,10,762,1876255,274382326290,3265588553925722827,
%T A263921 4299566944396584777543664576,828675148077536475804944305151462053905,
%U A263921 30068353582978459601855528390398866877243129478172220
%N A263921 Number of multisets of n permutations of [n] with the symmetric group acting on the permutation elements.
%C A263921 The Harary and Palmer text has the generic formulas for power group enumeration.
%C A263921 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
%C A263921 Row-latin squares distinct up to row/column permutation, with application to the Stable Marriage Problem representing distinct Men's or Women's preference profiles. - _Dan Eilers_, May 18 2025
%D A263921 F. Harary and E. Palmer, Graphical Enumeration, Academic Press, NY, 1973.
%H A263921 Ö. 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 A263921 Ö. 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 A263921 Dan Eilers, <a href="/A263921/a263921.txt">Examples for n=3, n=4</a>
%H A263921 Marko R. Riedel, <a href="http://math.stackexchange.com/questions/799707/">Combinatorial counting with symmetry</a>
%H A263921 Marko Riedel, <a href="/A263921/a263921.maple.txt">Maple implementation of Power Group Enumeration</a>
%e A263921 See linked examples.
%Y A263921 A123234 (reduced latin squares up to row/column permutation).
%K A263921 nonn
%O A263921 0,3
%A A263921 _Marko Riedel_, Oct 29 2015