OFFSET
1,1
COMMENTS
This sequence comes from a small change of an exercise proposed by Paul Erdős for Crux Mathematicorum (see link). In the solution, they show that for n >= 3, the fraction is always an integer for k = (n+1)! - 2. Be careful, n and k are swapped between Crux Mathematicorum and this sequence.
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..100
Wojcich Komornicki, Problem 556, Crux Mathematicorum, page 49, Vol. 8, Feb. 82.
EXAMPLE
If n = 1, for k = 2, 3, 4, 5, the fraction is respectively equal to 3/2, (4*5)/3, (5*6*7)/4, (6*7*8*9)/5 but for k = 6, the quotient is (7*8*9*10*11)/6 = 9240 and so a(1) = 6.
MATHEMATICA
a[n_] := Block[{k = n+1}, While[! IntegerQ[(1 + 2*k - 2*n)! (k-n)! / (k!)^2], k++]; k]; Array[a, 30] (* Giovanni Resta, Aug 11 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Bernard Schott, Aug 10 2017
EXTENSIONS
a(6)-a(46) from Giovanni Resta, Aug 11 2017
STATUS
approved