Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069783
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069783 GCD[d[(n!)^3],d[n! ]] = A069780[n! ]. +0
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 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

Table[GCD[DivisorSigma[0, (n!)^3], DivisorSigma[0, n! ]], {n, 1, 100}]

CROSSREFS

Cf. A000005, A000142, A069780-A069782.

Sequence in context: A097777 A089738 A110333 this_sequence A102251 A036122 A050124

Adjacent sequences: A069780 A069781 A069782 this_sequence A069784 A069785 A069786

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 08 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research