|
Search: id:A060146
|
|
|
| A060146 |
|
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 unique solutions for n. |
|
+0
1
|
| |
|
|
Search completed in 0.002 seconds
|
