Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071248
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071248 Prod( k=1..n, lcm(n,k) ). +0
3
1, 4, 54, 768, 75000, 466560, 592950960, 5284823040, 1735643790720, 45360000000000, 1035338990313196800, 102980960177356800, 145077660657859734604800, 154452450072526199193600 (list; graph; listen)
OFFSET

1,2

COMMENT

Log(a(n))/n/Log(n) is bounded since n^n < a(n) < n^(2n). It seems that lim n -> infinity Log(a(n))/n/Log(n) exists and = 1.7..... - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 13 2002

LINKS

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

FORMULA

a(n) = n!*Product_{ d divides n } d^phi(d). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 10 2004

a(n) = n!*n^n/A067911(n)=A000142(n)*A000312(n)/A067911(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 03 2007

MAPLE

A071248 := proc(n) mul( lcm(k, n), k=1..n) ; end: for n from 1 to 10 do printf("%d ", A071248(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 03 2007

PROGRAM

(PARI) a(n)=prod(k=1, n, lcm(n, k))

CROSSREFS

Product of terms in n-th row of A051173.

Cf. A067911, A056916.

Adjacent sequences: A071245 A071246 A071247 this_sequence A071249 A071250 A071251

Sequence in context: A073863 A089205 A055774 this_sequence A127833 A093983 A138459

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 21 2002

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 13 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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research