c语言编程：用递归方法求数列的和

#include double RecursiveSum(int n, int max){ if(n < max) { return RecursiveSum(n+1, max) + (double)n/(2*n+1); } else { return (double)n/(2*n+1); }}void main(){ int max; double result; scanf("%d", &max); result = RecursiveSum(1, max