OFFSET
2,1
COMMENTS
The second article by Myerson provides a Maple algorithm to compute a(n) when omega(n)=1. When omega(n) > 1, the maximum of a(p_i^n_i), with n = Product(p_i^n_i), is used.
Bachman and Kessler (2004) provide a table of a(n) for n < 100 being prime or a power of prime.
LINKS
G. Bachman, On divisibility properties of certain multinomial coefficients, Journal of Number Theory, Volume 63, Issue 2, April 1997, Pages 244-255.
G. Bachman and T. Kessler, On divisibility properties of certain multinomial coefficients—II, Journal of Number Theory, Volume 106, Issue 1, May 2004, Pages 1-12.
G. Myerson, What the Least Common Multiple Divides, Journal of Number Theory, Volume 48, Issue 1, July 1994, Pages 80-87.
G. Myerson and J. W. Sander, What the Least Common Multiple Divides, II, Journal of Number Theory, Volume 61, Issue 1, November 1996, Pages 67-84.
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Nov 20 2012
STATUS
approved