Amason wants to start building a stone pyramid the base of which has 551 blocks and the top 26th layer has only 1. if the number of blocks on each layer follow an arithmetic sequence, how many blocks should he get?

step-by-step explanation:

y = | -2(-2) |     →     y = | 4 |     →     y = 4       ⇒   (-2, 4)

y = | -2(-1) |     →     y = | 2 |     →       y =   2       ⇒   (-1, 2)    

y = | -2(0) |     →     y = | 0 |     →       y = 0         ⇒   (0, 0)

y = | -2(1) |   c →     y = | -2 |     →     y =   2         ⇒   (1, 2)    

y = | -2(2) |     →     y = | - 4 |     →     y =   4         ⇒   (2, 4)