1040635

Appears in sequences

• Take the first 2n integers and using each integer once and only once as either a numerator or a denominator, construct n fractions whose sum is an integer; a(n) = number of distinct solutions for n.at n=8A060146