cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A092495 Least factorial multiple of n.

This page as a plain text file.
%I A092495 #20 Nov 16 2020 03:07:23
%S A092495 1,2,6,24,120,6,5040,24,720,120,39916800,24,6227020800,5040,120,720,
%T A092495 355687428096000,720,121645100408832000,120,5040,39916800,
%U A092495 25852016738884976640000,24,3628800,6227020800,362880,5040
%N A092495 Least factorial multiple of n.
%H A092495 Reinhard Zumkeller, <a href="/A092495/b092495.txt">Table of n, a(n) for n = 1..100</a>
%F A092495 a(n) = A002034(n)!.
%F A092495 Sum_{n>=1} 1/a(n) = A071120. - _Amiram Eldar_, Nov 16 2020
%t A092495 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 A092495 With[{f=Range[30]!},Table[SelectFirst[f,Divisible[#,n]&],{n,30}]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Feb 25 2020 *)
%o A092495 (Haskell)
%o A092495 import Data.List (find)
%o A092495 import Data.Maybe (fromJust)
%o A092495 a092495 n = fromJust $ find ((== 0) . (`mod` n)) $ a000142_list
%o A092495 -- _Reinhard Zumkeller_, Aug 23 2011
%Y A092495 Cf. A000142, A002034, A071120.
%K A092495 nonn
%O A092495 1,2
%A A092495 _Amarnath Murthy_, Apr 02 2004
%E A092495 More terms from _Ray Chandler_, Apr 08 2004