login
This site is supported by donations to The OEIS Foundation.
Logo

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

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: A041789 A174899 A201370 * A007119 A064794 A127005

Adjacent sequences:  A093905 A093906 A093907 * A093909 A093910 A093911

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 24 2004

EXTENSIONS

Edited and extended by David Wasserman (dwasserm(AT)earthlink.net), Apr 25 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 06:44 EST 2012. Contains 205577 sequences.