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!)
A071248 a(n) = Product_{k=1..n} lcm(n,k). 4

%I #19 Jun 12 2019 16:06:34

%S 1,4,54,768,75000,466560,592950960,5284823040,1735643790720,

%T 45360000000000,1035338990313196800,102980960177356800,

%U 145077660657859734604800,154452450072526199193600

%N a(n) = Product_{k=1..n} lcm(n,k).

%C 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_, Aug 13 2002

%H T. D. Noe, <a href="/A071248/b071248.txt">Table of n, a(n) for n=1..100</a>

%F a(n) = n!*Product_{ d divides n } d^phi(d). - _Vladeta Jovovic_, Sep 10 2004

%F a(n) = n!*n^n/A067911(n)=A000142(n)*A000312(n)/A067911(n). - _R. J. Mathar_, Apr 03 2007

%p 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_, Apr 03 2007

%t Table[Product[LCM[k,n],{k,n}],{n,20}] (* _Harvey P. Dale_, Jun 12 2019 *)

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

%Y Product of terms in n-th row of A051173.

%Y Cf. A067911, A056916, A055774.

%K nonn

%O 1,2

%A _Amarnath Murthy_, May 21 2002

%E More terms from _Benoit Cloitre_, Aug 13 2002

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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)