We are given a1=b1=1, an=an−1+2 for n≥2, and bn=an+bn−1 for n≥2. We need to find n=1∑15an⋅bn.
Since an=a1+2(n−1) and a1=1, we obtain an=1+2(n−1)=2n−1, which enumerates the odd numbers 1, 3, 5, 7, ….
Next, applying the recursion bn=an+bn−1 with b1=1 gives
bn=b1+∑k=2nak=1+∑k=2n(2k−1)=1+(∑k=1n(2k−1))−1=∑k=1n(2k−1)=n2
A quick verification shows that b1=1=12, b2=a2+b1=3+1=4=22, and b3=5+4=9=32, confirming the pattern.
Hence, bn=n2.
We now compute the required sum as ∑n=115anbn=∑n=115(2n−1)n2, which can be separated into
∑n=115(2n−1)n2=∑n=115(2n3−n2)
=2∑n=115n3−∑n=115n2
For the sum of cubes, the standard formula gives ∑n=115n3=(215⋅16)2=1202=14400.
For the sum of squares, the formula yields ∑n=115n2=615⋅16⋅31=67440=1240.
Substituting these values into the expression gives
2(14400)−1240=28800−1240=27560
Consequently, the required sum is 27560.