The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110808 Least factorial obtained as n(n-1)...(n-k). 1
 1, 2, 6, 24, 120, 6, 5040, 40320, 362880, 720, 39916800, 479001600, 6227020800, 87178291200, 1307674368000, 20922789888000, 355687428096000, 6402373705728000, 121645100408832000, 2432902008176640000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Max (a(n)) = n!. a(n!) = n!. Define numbers of the type 10 as factoriable numbers. Are there any more such numbers? i.e. numbers of the type k such that a(k) is neither k nor k!. LINKS EXAMPLE a(10) = 10*9*8 = 720. a(6) = 6. MAPLE isfact := proc(n) local i ; for i from 1 do if i! = n then RETURN(true) ; elif i! > n then RETURN(false) ; fi ; od; end: A110808 := proc(n) local k, nfall ; for k from 0 do nfall := mul(n-i, i=0..k) ; if isfact(nfall) then RETURN(nfall) ; fi ; od: end: seq(A110808(n), n=1..40) ; # R. J. Mathar, Feb 08 2008 CROSSREFS Sequence in context: A177523 A005395 A092495 * A284567 A065422 A260850 Adjacent sequences:  A110805 A110806 A110807 * A110809 A110810 A110811 KEYWORD nonn AUTHOR Amarnath Murthy, Aug 14 2005 EXTENSIONS More terms from R. J. Mathar, Feb 08 2008 STATUS approved

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 August 4 15:50 EDT 2020. Contains 336202 sequences. (Running on oeis4.)