The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064778 Largest m such that 1..m all divide n!. 2
1, 2, 3, 4, 6, 6, 10, 10, 10, 10, 12, 12, 16, 16, 16, 16, 18, 18, 22, 22, 22, 22, 28, 28, 28, 28, 28, 28, 30, 30, 36, 36, 36, 36, 36, 36, 40, 40, 40, 40, 42, 42, 46, 46, 46, 46, 52, 52, 52, 52, 52, 52, 58, 58, 58, 58, 58, 58, 60, 60, 66, 66, 66, 66, 66, 66, 70, 70, 70, 70, 72 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Also the largest m such that 1!..m! all divide 2*A297707(n). - Lechoslaw Ratajczak, Apr 23 2019
LINKS
FORMULA
a(n) = A151800(n) - 1 for n != 3. - David A. Corneth, Apr 23 2019
MATHEMATICA
Do[ m = 1; While[ IntegerQ[n!/m], m++ ]; Print[m - 1], {n, 1, 100} ]
PROG
(PARI) { m=2; for (n=1, 1000, while (n!%m == 0, m++); write("b064778.txt", n, " ", m - 1) ) } \\ Harry J. Smith, Sep 24 2009
CROSSREFS
Sequence in context: A034890 A009490 A243930 * A317491 A332295 A332576
KEYWORD
easy,nonn
AUTHOR
Robert G. Wilson v, Oct 18 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 05:12 EDT 2024. Contains 372528 sequences. (Running on oeis4.)