OFFSET
1,10
COMMENTS
G. Myerson actually proved that P(n)/(P(n/2)*P(n/3)*P(n/7)*P(n/43)*...) is divisible by L(n) in a more general case. That is when n in the above expression is replaced by the terms of a sequence u(n) that satisfies GCD(u(n),u(m))=u(GCD(m,n)). And also when the sequence of quotients q(n)=2,3,7,43,... is replaced by a sequence q(n) such that sum(1/q(n))<=1.
The behavior of a(n) is quite erratic for small values of n, for instance a(26)=10, a(32)=1, a(65)=1430, a(84)=2, a(95)=542640, a(114)=3 (cf. Myerson 1994).
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.
PROG
(PARI) a(n)=my(t=n!/lcm(vector(n, i, i))/(n\2)!, a1=2, a2=3); while(a2<n, t /= (n\a2)!; [a1, a2]=[a2, a2^2-a2+1]); t \\ Charles R Greathouse IV, Nov 19 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Nov 19 2012
STATUS
approved