This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A102068 P(n)!, where P(n) is the largest prime factor of n (with a(1) = 1). 4
 1, 2, 6, 2, 120, 6, 5040, 2, 6, 120, 39916800, 6, 6227020800, 5040, 120, 2, 355687428096000, 6, 121645100408832000, 120, 5040, 39916800, 25852016738884976640000, 6, 120, 6227020800, 6, 5040 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS P(n)! is a multiple of n, for almost all n. The exceptions are A057109. REFERENCES I. Kastanas, The smallest factorial that is a multiple of n, Amer. Math. Monthly 101 (1994) 179. LINKS Eric Weisstein's World of Mathematics, GreatestPrimeFactor FORMULA a(n) = A000142(A006530(n)) = A000040(A061395(n))!. EXAMPLE P(12)! = 3! = 6. CROSSREFS Cf. A000040, A000142, A006530, A057109, A061395, A102067. Sequence in context: A122018 A005729 A086660 * A188733 A104290 A152549 Adjacent sequences:  A102065 A102066 A102067 * A102069 A102070 A102071 KEYWORD nonn AUTHOR Jonathan Sondow, Dec 28 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 23 17:52 EDT 2013. Contains 225611 sequences.