The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092495 Least factorial multiple of n. 6
 1, 2, 6, 24, 120, 6, 5040, 24, 720, 120, 39916800, 24, 6227020800, 5040, 120, 720, 355687428096000, 720, 121645100408832000, 120, 5040, 39916800, 25852016738884976640000, 24, 3628800, 6227020800, 362880, 5040 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..100 FORMULA a(n) = A002034(n)!. MATHEMATICA Reap[Do[m = 1; While[an = m!; !IntegerQ[an/n], m++]; Print[n, " ", an]; Sow[an], {n, 1, 28}]][[2, 1]] (* Jean-François Alcover, Dec 04 2018 *) With[{f=Range[30]!}, Table[SelectFirst[f, Divisible[#, n]&], {n, 30}]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Feb 25 2020 *) PROG (Haskell) import Data.List (find) import Data.Maybe (fromJust) a092495 n = fromJust \$ find ((== 0) . (`mod` n)) \$ a000142_list -- Reinhard Zumkeller, Aug 23 2011 CROSSREFS Cf. A000142, A002034. Sequence in context: A202236 A177523 A005395 * A110808 A284567 A065422 Adjacent sequences:  A092492 A092493 A092494 * A092496 A092497 A092498 KEYWORD nonn AUTHOR Amarnath Murthy, Apr 02 2004 EXTENSIONS More terms from Ray Chandler, Apr 08 2004 STATUS approved

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

Last modified August 4 15:50 EDT 2020. Contains 336202 sequences. (Running on oeis4.)