This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A048765 Smallest factorial >= n. 3
 1, 2, 6, 6, 6, 6, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 REFERENCES K. Atanassov, On the 43rd and 44th Smarandache Problems, Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 5 (1999), No. 2, 86-88. J. Castillo, Other Smarandache Type Functions: Inferior/Superior Smarandache f-part of x, Smarandache Notions Journal, Vol. 10, No. 1-2-3, 1999, 202-204. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 K. Atanassov, On Some of Smarandache's Problems F. Smarandache, Only Problems, Not Solutions!. FORMULA n <= a(n) << n log n / log log n. - Charles R Greathouse IV, Sep 19 2012 MATHEMATICA Join[{1}, Flatten[Table[Table[n!, n!-(n-1)!], {n, 5}]]] (* Harvey P. Dale, Jun 15 2016 *) PROG (Haskell) a048764 n = a048764_list !! (n-1) a048764_list = f [1..] \$ tail a000142_list where    f (u:us) vs'@(v:vs) | u == v    = v : f us vs                        | otherwise = v : f us vs' -- Reinhard Zumkeller, Jun 04 2012 (PARI) a(n)=my(t=1, k=1); while(t

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 May 19 04:06 EDT 2019. Contains 323377 sequences. (Running on oeis4.)