Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067911
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067911 Product of GCD(k,n) for 1 <= k <= n. +0
5
1, 2, 3, 8, 5, 72, 7, 128, 81, 800, 11, 41472, 13, 6272, 30375, 32768, 17, 3359232, 19, 20480000, 750141, 247808, 23, 13759414272, 15625, 1384448, 1594323, 5035261952, 29, 30233088000000, 31, 2147483648, 235782657, 37879808 (list; graph; listen)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..500

FORMULA

a(n) = Product_{ d divides n } d^phi(n/d). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 08 2004

CROSSREFS

Cf. A018804, where product is replaced by sum.

Product of terms in n-th row of A050873.

Sequence in context: A128779 A112283 A136182 this_sequence A051696 A066570 A073656

Adjacent sequences: A067908 A067909 A067910 this_sequence A067912 A067913 A067914

KEYWORD

nonn

AUTHOR

Sharon Sela (sharonsela(AT)hotmail.com), Mar 10 2002

EXTENSIONS

Extended and edited by John W. Layman (layman(AT)math.vt.edu) Mar 14 2002

page 1

Search completed in 0.006 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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research