Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110808
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110808 Least factorial obtained as n(n-1)...(n-k). +0
1
1, 2, 6, 24, 120, 6, 5040, 40320, 362880, 720, 39916800, 479001600, 6227020800, 87178291200, 1307674368000, 20922789888000, 355687428096000, 6402373705728000, 121645100408832000, 2432902008176640000 (list; graph; listen)
OFFSET

1,2

COMMENT

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!.

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 (mathar(AT)strw.leidenuniv.nl), Feb 08 2008

CROSSREFS

Sequence in context: A071077 A005395 A092495 this_sequence A065422 A008336 A033643

Adjacent sequences: A110805 A110806 A110807 this_sequence A110809 A110810 A110811

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 14 2005

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 08 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research