amortized analysis of dynamic array resizing : A question on amortized analysis of dynamic array resizing that has me stumped

Instead of copying the N elements into an array of 2N, they are copied into an array with N/4 additional cells, going to capacity N + N/4
Show that performing a sequence of n additions to the array runs in O(n)

Any tips, help much appreciated

(not homework)