This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A093908 Let f(k, n) be the product of n consecutive numbers beginning with k. Then a(n) is the least k > 1+n*(n-1)/2 such that f(k, n) is a multiple of f(1+n*(n-1)/2, n). 1
 2, 3, 8, 39, 52, 187, 204, 863, 773, 6621, 34038, 2404, 34440, 223097, 11976, 1106290, 1980047, 85119892, 15308072, 496820597, 2590416388, 1087065675, 4736428784, 1128909067, 242793786666, 2791304683100, 273924845940 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS f(k, n) = A008279(n+k-1, n). 1+n*(n-1)/2 = A000124(n-1). f(1+n*(n-1)/2, n) = A057003(n). a(28) > 88*10^12. LINKS EXAMPLE a(4) = 39 because 39*40*41*42 is divisible by 7*8*9*10. No smaller set gives a product that is a multiple of 7*8*9*10. CROSSREFS Cf. A000124, A008279, A057003, A093909. Sequence in context: A174899 A201370 A233532 * A007119 A064794 A127005 Adjacent sequences:  A093905 A093906 A093907 * A093909 A093910 A093911 KEYWORD nonn AUTHOR Amarnath Murthy, Apr 24 2004 EXTENSIONS Edited and extended by David Wasserman, Apr 25 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 01:57 EST 2019. Contains 329850 sequences. (Running on oeis4.)