login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068819 n!/((n+1)*(n+2)*...*(n+k)) where k is largest value that gives an integer quotient. 1
1, 2, 6, 24, 20, 720, 7, 448, 36288, 3628800, 3326400, 479001600, 1853280, 363242880, 81729648000, 20922789888000, 19760412672000, 6402373705728000, 13165054156800, 5266021662720000, 2322315553259520000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
n! is divisible by all the numbers from n+1 to n+k where n+k+1 is the smallest prime greater than n. Conjecture: For n > 3 n! is divisible by product(n+k,n)= (n+1)(n+2)...(n+k).
REFERENCES
Amarnath Murthy, Smarandache Reciprocal function and an elementary inequality. Smarandache Notions Journal Vol. 11, 2000.
LINKS
FORMULA
a(n) = smallest integer value of (n!)^2/(n+k)! i.e. n+k+1 does not divide a(n).
EXAMPLE
a(7)= 7 as 5040/8 = 630, 630/9 = 70, 70/10 = 7 but 7 is not divisible by 11.
MATHEMATICA
a[3] = 6; a[n_] := n!^2/(NextPrime[n]-1)!; Table[a[n], {n, 1, 21}](* Jean-François Alcover, Feb 16 2012 *)
CROSSREFS
Sequence in context: A319544 A354833 A124900 * A060068 A099732 A118381
KEYWORD
easy,nice,nonn
AUTHOR
Amarnath Murthy, Mar 08 2002
EXTENSIONS
Corrected by T. D. Noe, May 08 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 17:27 EDT 2024. Contains 374808 sequences. (Running on oeis4.)