Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Nov 16 2020 03:07:23
%S 1,2,6,24,120,6,5040,24,720,120,39916800,24,6227020800,5040,120,720,
%T 355687428096000,720,121645100408832000,120,5040,39916800,
%U 25852016738884976640000,24,3628800,6227020800,362880,5040
%N Least factorial multiple of n.
%H Reinhard Zumkeller, <a href="/A092495/b092495.txt">Table of n, a(n) for n = 1..100</a>
%F a(n) = A002034(n)!.
%F Sum_{n>=1} 1/a(n) = A071120. - _Amiram Eldar_, Nov 16 2020
%t 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 *)
%t With[{f=Range[30]!},Table[SelectFirst[f,Divisible[#,n]&],{n,30}]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Feb 25 2020 *)
%o (Haskell)
%o import Data.List (find)
%o import Data.Maybe (fromJust)
%o a092495 n = fromJust $ find ((== 0) . (`mod` n)) $ a000142_list
%o -- _Reinhard Zumkeller_, Aug 23 2011
%Y Cf. A000142, A002034, A071120.
%K nonn
%O 1,2
%A _Amarnath Murthy_, Apr 02 2004
%E More terms from _Ray Chandler_, Apr 08 2004