cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Amarnath Murthy, Apr 24 2004

Keywords

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.

Examples

			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

Extensions

Edited and extended by David Wasserman, Apr 25 2007