A093908 - cp's OEIS frontend

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

n	a(n)
1	2
2	3
3	8
4	39
5	52
6	187
7	204
8	863
9	773
10	6621
11	34038
12	2404
13	34440
14	223097
15	11976
16	1106290
17	1980047
18	85119892
19	15308072
20	496820597
21	2590416388
22	1087065675
23	4736428784
24	1128909067
25	242793786666
26	2791304683100
27	273924845940

[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]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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