问题设数列{a_n}的前m项为a_1,a_2,…,a_m,且a_(n+m_=a_n+d(n=1,2,…),d为非零常数,求数列{a_n}的前n项之和S_n.这类递推数列的求和问题,是求递推数列前n项和中难度最大的问题.为此,本文以实例来说明它的求 The first m entries of the problem set column {a_n} are a_1, a_2, ..., a_m, and a_(n+m_=a_n+d(n=1, 2, ...), d is a nonzero constant, and the search sequence {a_n} The summation of the first n terms S_n. The summation problem of such recursive sequences is the problem of resolving the first n terms and the most difficult problem in the recursive sequence. To this end, this article uses examples to illustrate its requirements.