|
| |
|
|
A025527
|
|
a(n) = n!/LCM{1,2,...,n} = (n-1)!/LCM{C(n-1,0),C(n-1,1),...,C(n-1,n-1)}.
|
|
11
| |
|
|
1, 1, 1, 2, 2, 12, 12, 48, 144, 1440, 1440, 17280, 17280, 241920, 3628800, 29030400, 29030400, 522547200, 522547200, 10450944000, 219469824000, 4828336128000, 4828336128000, 115880067072000, 579400335360000, 15064408719360000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| a(n)=a(n-1) iff n is prime. Thus a(1)=a(2)=a(3)=1 is the only triple in this sequence. - Franz Vrabec (franz.vrabec(AT)aon.at), Sep 10 2005
a(k)=a(k+1) for k=A006093. - Lekraj Beedassy (blekraj(AT)yahoo.com), Aug 03 2006
a(n) are the partial products of A048671(n). [From Peter Luschny (peter(AT)luschny.de), Sep 09 2009]
|
|
|
LINKS
| Index entries for sequences related to lcm's
|
|
|
FORMULA
| a(n)=A000142(n)/A003418(n)=A000254(n)/A025529(n). - Franz Vrabec (franz.vrabec(AT)aon.at), Sep 13 2005
|
|
|
EXAMPLE
| a(5) = 2 as 5!/LCM(1..5) = 120/60 = 2.
|
|
|
MAPLE
| seq(n!/lcm($1..n), n=1..30);
A025527 := proc(n) option remember; `if`(n < 3, 1, ilcm(op(numtheory[divisors](n) minus{1, n}))*A025527(n-1)) end:
seq(A025527(i), i=1..26); # - Peter Luschny, Mar 23 2011.
|
|
|
PROG
| (Sage)
def A025527(n) :
if n < 2 : return 1
else :
D = divisors(n); D.pop()
return lcm(D)*A025527(n-1)
[A025527(i) for i in (1..26)] # Peter Luschny, Feb 03 2012
|
|
|
CROSSREFS
| Sequence in context: A196061 A131121 A055772 * A092144 A181813 A059187
Adjacent sequences: A025524 A025525 A025526 * A025528 A025529 A025530
|
|
|
KEYWORD
| nonn,changed
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
