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.

Original entry on oeis.org

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
Offset: 1

Views

Author

Amarnath Murthy, Apr 02 2004

Keywords

Crossrefs

Programs

  • Haskell
    import Data.List (find)
    import Data.Maybe (fromJust)
    a092495 n = fromJust $ find ((== 0) . (`mod` n)) $ a000142_list
    -- Reinhard Zumkeller, Aug 23 2011
  • 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 *)

Formula

a(n) = A002034(n)!.
Sum_{n>=1} 1/a(n) = A071120. - Amiram Eldar, Nov 16 2020

Extensions

More terms from Ray Chandler, Apr 08 2004