|
|
A092495
|
|
Least factorial multiple of n.
|
|
7
|
|
|
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
|
|
|
FORMULA
|
|
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|