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!)
A172613 a(n) = (9n)!/(9!^n). 6
1, 1, 48620, 227873431500, 21452752266265320000, 19010638202652030712978200000, 101097362223624462291180422369532000000, 2392741010223442438553822446842770682716580000000, 203653377853981828616656775313699668953042169048889600000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
From Tilman Piesk, Oct 30 2014: (Start)
Column 9 of A187783.
Number of permutations of a multiset that contains n different elements, each occurring 9 times.
Or in other words (the former title of this sequence):
Number of 9*n X n 0..1 arrays with row sums 1 and column sums 9.
(End)
LINKS
Tilman Piesk, Table of n, a(n) for n = 0..54 (first 11 terms from R. H. Hardin)
FORMULA
a(n) = (9n)!/(9!^n).
EXAMPLE
a(3) = (9*3)!/(9!^3) = 227873431500 is the number of permutations of a multiset that contains 3 different elements, each occurring 9 times, e.g., {1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3}.
MAPLE
A172613:=n->(9*n)!/(362880^n): seq(A172613(n), n=0..10); # Wesley Ivan Hurt, Nov 01 2014
MATHEMATICA
Table[(9 n)! / (362880^n), {n, 0, 10}] (* Vincenzo Librandi, Nov 01 2014 *)
PROG
(Magma) [Factorial(9*n)/(362880^n): n in [0..20]]; // Vincenzo Librandi, Nov 01 2014
CROSSREFS
Sequence in context: A351488 A177314 A177315 * A172554 A244172 A245794
KEYWORD
nonn,easy
AUTHOR
R. H. Hardin, Feb 06 2010
EXTENSIONS
Name changed by Tilman Piesk, Oct 30 2014
STATUS
approved

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 13 07:35 EDT 2024. Contains 371638 sequences. (Running on oeis4.)