The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A334286 Number of factorizations of m^n into n factors, where m is a product of exactly n distinct primes and each factor is a product of n primes (counted with multiplicity). 2
 1, 1, 2, 10, 465, 190131, 848597563, 43025433375905, 26004966055138634525, 194173310204064149748222455, 18434259996904142171888712495703426, 22778257480946919793779826285286813732062310, 373444566958856976964193391832469245535883039838631492 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Also number of ways to partition the multiset consisting of n copies each of 1, 2, ..., n into n multisets of size n. LINKS FORMULA a(n) = A257462(n,n) = A257463(n,n). EXAMPLE a(3) = 10: (2*3*5)^3 = 2700 = 30*30*30 = 45*30*20 = 50*27*20 = 50*30*18 = 50*45*12 = 75*20*18 = 75*30*12 = 75*45*8 = 125*18*12 = 125*27*8. CROSSREFS Main diagonal of A257462 and of A257463. Sequence in context: A013034 A207140 A059723 * A265627 A112449 A011824 Adjacent sequences:  A334283 A334284 A334285 * A334287 A334288 A334289 KEYWORD nonn AUTHOR Alois P. Heinz, Apr 21 2020 EXTENSIONS More terms from Andrew Howroyd, Apr 21 2020 STATUS approved

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

Last modified January 18 00:56 EST 2021. Contains 340249 sequences. (Running on oeis4.)