A257463 -id:A257463 - cp's OEIS frontend

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).

1, 1, 2, 10, 465, 190131, 848597563, 43025433375905, 26004966055138634525, 194173310204064149748222455, 18434259996904142171888712495703426, 22778257480946919793779826285286813732062310, 373444566958856976964193391832469245535883039838631492

Offset: 0

Graph
List
Refs
Listen
History
Text
Internal format

Alois P. Heinz, Apr 21 2020

nonn

Also number of ways to partition the multiset consisting of n copies each of 1, 2, ..., n into n multisets of size n.

			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.

Main diagonal of A257462 and of A257463.

a(n) = A257462(n,n) = A257463(n,n).

More terms from Andrew Howroyd, Apr 21 2020

cp's OEIS Frontend

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).

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Extensions