cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A025527 a(n) = n!/lcm{1,2,...,n} = (n-1)!/lcm{C(n-1,0), C(n-1,1), ..., C(n-1,n-1)}.

Original entry on oeis.org

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
Offset: 1

Views

Author

Clark Kimberling, Dec 11 1999

Keywords

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, Sep 10 2005
a(k) = a(k+1) for k in A006093. - Lekraj Beedassy, Aug 03 2006
Partial products of A048671. - Peter Luschny, Sep 09 2009

Examples

			a(5) = 2 as 5!/lcm(1..5) = 120/60 = 2.
		

Crossrefs

Programs

Formula

a(n) = A000142(n)/A003418(n) = A000254(n)/A025529(n). - Franz Vrabec, Sep 13 2005
log a(n) = n log n - 2n + O(n/log^4 n). (The error term can be improved. On the Riemann Hypothesis it is O(n^k) for any k > 1/2.) - Charles R Greathouse IV, Oct 16 2012
a(n) = A205957(n), 1 <= n <= 11. - Daniel Forgues, Apr 22 2014
Conjecture: a(A006093(n)) = phi(A000142(A006093(n))) / phi(A003418(A006093(n))), where phi is the Euler totient function. - Fred Daniel Kline, Jun 03 2017