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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060238 det(M) where M is an n X n matrix with M[i,j]=lcm(i,j). 6
1, -2, 12, -48, 960, 11520, -483840, 3870720, -69672960, -2786918400, 306561024000, 7357464576000, -1147764473856000, -96412215803904000, -11569465896468480000, 185111454343495680000, -50350315581430824960000, -1812611360931509698560000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Enrique Pérez Herrero, Table of n, a(n) for n = 1..200

FORMULA

For n >= 2 a(n) = n! * product(j=2, ..., n)(product(p|j)(1-p)) (where the second product is over all primes p that divide j) [Cf. A023900] - Avi Peretz (njk(AT)netvision.net.il), Mar 22 2001

a(n)=n!*prod(p<n,(1-p)^floor(n/p)) where the product runs through the primes. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 31 2008

a(n)=A000142(n)*A085542(n) [From Enrique Perez Herrero (psychgeometry(AT)gmail.com), Jun 08 2010]

MATHEMATICA

A060238 [n_]:=n!*Product[(1 - Prime[i])^Floor[n/Prime[i]], {i, 1, PrimePi[n]}]; [From Enrique Perez Herrero (psychgeometry(AT)gmail.com), Jun 08 2010]

PROG

(PARI) a(n)=n!*prod(p=1, sqrtint(n), if(isprime(p), (1-p)^floor(n/p), 1)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 31 2008

CROSSREFS

Cf. A001088, A060239.

Sequence in context: A088311 A052588 A139239 * A085495 A119978 A139234

Adjacent sequences:  A060235 A060236 A060237 * A060239 A060240 A060241

KEYWORD

sign

AUTHOR

MCKAY john (mckay(AT)cs.concordia.ca), Mar 21 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 14:07 EST 2012. Contains 205623 sequences.