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!)
A069783 a(n) = gcd(d(n!^3), d(n!)) = A069780(n!), where d() is the number of divisors function. 2
1, 2, 4, 8, 16, 2, 4, 32, 32, 10, 20, 8, 16, 32, 448, 448, 1792, 32, 64, 80, 3200, 1280, 2560, 320, 448, 1792, 25088, 101920, 203840, 128, 256, 4096, 81920, 112640, 2048, 8960, 17920, 1024, 2048, 5120, 10240, 5734400, 11468800, 1003520, 250880, 8960, 17920 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
Table[GCD[DivisorSigma[0, (n!)^3], DivisorSigma[0, n! ]], {n, 1, 100}]
CROSSREFS
Sequence in context: A089738 A110333 A247292 * A102251 A339853 A373944
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Apr 08 2002
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 September 16 20:53 EDT 2024. Contains 375977 sequences. (Running on oeis4.)