login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059384 a(n) = Product_{i=1..n} J_5(i). 6
1, 31, 7502, 7441984, 23248758016, 174412182636032, 2931171141381153792, 93047096712003345973248, 5471727569246068763302821888, 529903984716066283313298482921472, 85341036738522474927606720674503065600, 20487310643596659421020979792003903940198400 (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)^5 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

G. C. Greubel, Table of n, a(n) for n = 1..120

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_Integer, k_: 1] := DivisorSum[n, #^k*MoebiusMu[n/#] &];  f[n_] := Times @@ (JordanTotient[#, 5] & /@ Range[n]); (* _Enrique PĂ©rez Herrero _*)  Array[f, 11] (* Robert G. Wilson v, Oct 08 2011 *)

CROSSREFS

Cf. A001088, A059378, A059381, A059382, A059383, A175836.

Sequence in context: A065756 A263378 A212858 * A136676 A135811 A119598

Adjacent sequences:  A059381 A059382 A059383 * A059385 A059386 A059387

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 00:02 EST 2018. Contains 317275 sequences. (Running on oeis4.)