id:A093908 - OEIS Search Results

Search: id:A093908

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`1,1`
	COMMENT	`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 39404142 is divisible by 78910. No` `smaller set gives a product that is a multiple of 789*10.`
	CROSSREFS	`Cf. A000124, A008279, A057003, A093909.` `Sequence in context: A112866 A041657 A041789 this_sequence A007119 A064794 A127005` `Adjacent sequences: A093905 A093906 A093907 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research