Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Mar 26 2022 17:45:39
%S 1,8,666,295240,503167995,2629770332904,35773664992355004,
%T 1119582594247762626696,73241437035618231162682185,
%U 9277639855710782695858431981840,2137918570337064383107929197622033920,850936582591338109213109187016928388683280
%N Number of orbits of the wreath product of S_n with S_n on n X n matrices over {0,1,2,3,4,5,6,7}.
%C This is the number of possible votes of n referees judging n dancers by a mark between 0 and 7, where the referees cannot be distinguished.
%C a(n) is the number of n element multisets of n element multisets of an 8-set. - _Andrew Howroyd_, Jan 17 2020
%H Andrew Howroyd, <a href="/A099126/b099126.txt">Table of n, a(n) for n = 0..100</a>
%F a(n) = binomial(binomial(n + 7, n) + n - 1, n). - _Andrew Howroyd_, Jan 17 2020
%o (PARI) a(n)={binomial(binomial(n + 7, n) + n - 1, n)} \\ _Andrew Howroyd_, Jan 17 2020
%Y Column k=8 of A331436.
%Y Cf. A099121, A099122, A099123, A099124, A099125, A099127, A099128.
%K nonn
%O 0,2
%A _Sascha Kurz_, Oct 11 2004
%E a(0)=1 prepended and a(11) and beyond from _Andrew Howroyd_, Jan 17 2020