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!)
A059382 Product J_3(i), i=1..n. 8
1, 7, 182, 10192, 1263808, 230013056, 78664465152, 35241680388096, 24739659632443392, 21474024560960864256, 28560452666077949460480, 41584019081809494414458880, 91318505903653649734151700480, 218616503133346837463559170949120 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) is also the determinant of the symmetric n X n matrix M defined by M(i,j) = gcd(i,j)^3 for 1 <= i,j <= n. - Avi Peretz (njk(AT)netvision.net.il), Mar 22 2001
REFERENCES
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 203, #17.
LINKS
Enrique Pérez Herrero, Table of n, a(n) for n = 1..100
Antal Bege, Hadamard product of GCD matrices, Acta Univ. Sapientiae, Mathematica, 1, 1 (2009) 43-49.
Eric Weisstein's World of Mathematics, Le Paige's Theorem
MATHEMATICA
JordanTotient[n_, k_:1]:=DivisorSum[n, #^k*MoebiusMu[n/#]&]/; (n>0)&&IntegerQ[n]; A059382[n_]:=Times@@(JordanTotient[#, 3]&/@Range[n]); (* Enrique Pérez Herrero, Aug 06 2011 *)
CROSSREFS
Sequence in context: A219404 A202026 A302904 * A158620 A217242 A217243
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 28 2001
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 March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)