Example 2 Let the terms of the sequence {an} be 1,1,2,2,2,2,2,⋯,(3n−1)↑n,n,⋯,n,⋯.
Find an and Sn.
A number or a short expression. Spacing and $ signs are ignored.
Solution
Solution: By the formula for the sum of an arithmetic sequence, the sum of the first (m−1) segments of the sequence an is 2+5+8+⋯+(3m−4)=21(m−1)(3m−2).
It is evident that, if and only if 21(m−1)(3m−2)+1⩽n⩽21m(3m+1)
then, an=m. Solving the inequality (2) for m, we get 6−1+24n+1⩽m⩽65+24n−23.
The number of identical terms is (3m−1) for m=1,2,⋯. ∵0<65+24n−23−6−1+24n+1<1, ∴m is the integer part of 61(5+24n−23), denoted as m=[65+24n−23]. Thus, an=[65+24n−23]. Therefore, the sum of the first n segments of the sequence {an} is SnP2=1×2+2×5+3×8+⋯+n(3n−1)=3(12+22+⋯+n2)−(1+2+⋯+n)=3×61n(n+1)(2n+1)−21n(n+1)=n2(n+1).
Substituting n with (m−1), we get the sum of the first (m−1) segments as S21(m−1)(3m−2)=m(m−1)2. ∵an=m, ∴ the sum of the first n terms of the sequence {an} is Sn= where =S21(m−1)(3m−2)+[n−21(m−1)(3m−2)]mm(m−1)2+mn−21m(m−1)(3m−2)=mn−21m2(m−1),m=[65+24n−23].
Note: From the above two examples, it can be seen that only by deeply understanding the dual role of n in the sequence {an}, which is to determine the number of terms (or segments) and the elements, can such problems be correctly solved. The variable n not only determines the elements of each term (or segment) in the summation but also decides the number of terms (or segments).
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.