A computer reads a program the way you would follow a recipe card if you were not allowed to skip around: one instruction, completely, then the next. Take this program: price = 4; count = 3; total = price * count; count = 5; print(total). Line 3 computes 4 * 3 = 12 and stores 12 in total. Line 4 changes count to 5, but total does not recompute itself; it keeps the 12 it was given. The program prints 12.
Each line uses the values that exist at the moment it runs. A trace table makes this visible: one column per variable, one row per line, filled in as you go. After line 2: price 4, count 3. After line 3: total 12. After line 4: count 5, while total is still 12. Reading the finished table from the bottom row tells you exactly what print will show.
Contrast this with a spreadsheet, where a cell holding =A1*B1 updates by itself whenever A1 or B1 changes. Program variables are not formulas; they hold whatever was last stored in them. Sequence also differs from the other control structures: in pure sequence every line runs exactly once, top to bottom. If a line might be skipped, you are looking at selection; if a line runs again, you are looking at iteration.
Think of it like this. Sequence is like a row of dominoes: each one falls only after the one before it, and you cannot make the fifth fall first. Move one domino to a later spot and everything after it happens differently. Unlike dominoes, a program can later jump back or skip ahead, but that takes selection or loops.
Core idea. Each step must complete fully before the next step begins; the order determines the result.