A219365 -id:A219365 - cp's OEIS frontend

A219434 a(n) is the maximum number m such that A219365(m) is not divisible by n.

1966081, 12767708, 7756710936577, 166762837500004, 12767708, 27471403862610413838, 31057143398401, 340744843326260, 166762837500004, 22895635022104088254, 7756710936577, 766556623996809099695470878, 27471403862610413838, 166762837500004, 62114286796801

Offset: 2

Michel Marcus, Nov 20 2012

nonn

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.

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.

Cf. A219365.

cp's OEIS Frontend

A219434 a(n) is the maximum number m such that A219365(m) is not divisible by n.

Views

Author

Keywords

Comments

Links

Crossrefs