Divisibility is transitive, so every term of a progressive sequence is a multiple of the first term. If a sequence with sum $360$ has length at least $2$ and first term $d,$ then $d \mid 360,$ and dividing the remaining terms by $d$ yields a progressive sequence with first term at least $2$ and sum $\frac{360 - d}{d} = \frac{360}{d} - 1;$ this correspondence is reversible. So if $g(s)$ denotes the number of progressive sequences with sum $s$ and first term at least $2,$ the answer is $1 + \sum_{d \mid 360,\, d \lt 360} g\!\left(\frac{360}{d} - 1\right),$ the leading $1$ counting the sequence $(360).$

The same reduction gives the recursion $$\begin{aligned} g(s) &= 1 + \sum_{\substack{e \mid s \\ 2 \le e \lt s}} g\!\left(\frac{s}{e} - 1\right) \\ &\qquad (s \ge 2), \end{aligned}$$ with $g(1) = 0;$ in particular $g(s) = 1$ when $s$ is prime. Working upward: $g(2) = g(3) = g(4)$ $= g(5) = g(7) = 1;$ $g(6) = 1 + g(2) = 2;$ $g(8) = 1 + g(3) = 2;$ $g(9) = 1 + g(2) = 2;$ $g(10) = 1 + g(4) = 2;$ $g(12) = 1 + g(5) + g(3) + g(2)$ $= 4;$ $g(14) = 1 + g(6) = 3;$ $g(16) = 1 + g(7) + g(3) = 3;$ $g(21) = 1 + g(6) + g(2) = 4;$ $g(35) = 1 + g(6) + g(4) = 4;$ $g(39) = 1 + g(12) + g(2) = 6;$ $g(44) = 1 + g(21) + g(10)$ $+ g(3) = 8;$ $g(119) = 1 + g(16) + g(6) = 6.$

The $23$ divisors $d \lt 360$ give arguments $\frac{360}{d} - 1 = 359,$ $179,$ $119,$ $89,$ $71,$ $59,$ $44,$ $39,$ $35,$ $29,$ $23,$ $19,$ $17,$ $14,$ $11,$ $9,$ $8,$ $7,$ $5,$ $4,$ $3,$ $2,$ $1,$ whose $g$-values are $1, 1, 6, 1,$ $1, 1, 8, 6,$ $4, 1, 1, 1,$ $1, 3, 1, 2,$ $2, 1, 1, 1,$ $1, 1, 0,$ summing to $46.$ Adding the single-term sequence gives $46 + 1 = 47.$