OFFSET
0,3
COMMENTS
Divisible by n+1. Proof: Exponent of largest prime dividing n! in prime factorization of n! is 1, i.e., n! = p_1^e_1*p_2^e_2*...*p_(s-1)^e_(s-1)*p_s, p_1<p_2<....<p_(s-1)<p_s. Thus tau(n!^n) = (n*e_1+1)*(n*e_2+1)*...*(n*e_(s-1)+1)*(n+1). - Vladeta Jovovic, Oct 01 2004
PROG
(PARI) for(n=0, 22, print(numdiv((n!)^n)))
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Jul 22 2001
STATUS
approved