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

 


a(n) = d(n)!, where d denotes the number of divisors of n.
8

%I #5 Nov 21 2013 12:49:05

%S 1,2,2,6,2,24,2,24,6,24,2,720,2,24,24,120,2,720,2,720,24,24,2,40320,6,

%T 24,24,720,2,40320,2,720,24,24,24,362880,2,24,24,40320,2,40320,2,720,

%U 720,24,2,3628800,6,720,24,720,2,40320,24,40320,24,24,2,479001600,2,24

%N a(n) = d(n)!, where d denotes the number of divisors of n.

%H Harvey P. Dale, <a href="/A130674/b130674.txt">Table of n, a(n) for n = 1..1000</a>

%t DivisorSigma[0,Range[70]]! (* _Harvey P. Dale_, Oct 06 2011 *)

%Y Cf. A000005.

%K nonn

%O 1,2

%A _Giovanni Teofilatto_, Aug 12 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 24 00:34 EDT 2024. Contains 376185 sequences. (Running on oeis4.)