Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060238
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060238 det(M) where M is an n X n matrix with M[i,j]=lcm(i,j). +0
6
1, -2, 12, -48, 960, 11520, -483840, 3870720, -69672960, -2786918400, 306561024000, 7357464576000, -1147764473856000, -96412215803904000, 11569465896468480000, 185111454343495680000 (list; graph; listen)
OFFSET

1,2

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

PROGRAM

(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 this_sequence A085495 A119978 A139234

Adjacent sequences: A060235 A060236 A060237 this_sequence A060239 A060240 A060241

KEYWORD

sign

AUTHOR

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

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research