login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099123 Number of orbits of the wreath product of S_n with S_n on n X n matrices over {0,1,2,3,4}. 9

%I #11 Jan 17 2020 21:35:02

%S 1,5,120,7770,1088430,286243776,127860662755,90079147136880,

%T 94572327271677750,141504997346476482290,291098519807782284023426,

%U 799388312264077003441393875,2859142263297618955891805452700

%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}.

%C This is the number of possible votes of n referees judging n dancers by a mark between 0 and 4, where the referees cannot be distinguished.

%C a(n) is the number of n element multisets of n element multisets of a 5-set. - _Andrew Howroyd_, Jan 17 2020

%H Andrew Howroyd, <a href="/A099123/b099123.txt">Table of n, a(n) for n = 0..100</a>

%F a(n) = binomial(binomial(n + 4, n) + n - 1, n). - _Andrew Howroyd_, Jan 17 2020

%o (PARI) a(n)={binomial(binomial(n + 4, n) + n - 1, n)} \\ _Andrew Howroyd_, Jan 17 2020

%Y Column k=5 of A331436.

%Y Cf. A099121, A099122, A099124, A099125, A099126, A099127, A099128.

%K nonn

%O 0,2

%A _Sascha Kurz_, Sep 28 2004

%E a(0)=1 prepended by _Andrew Howroyd_, Jan 17 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)