We study integer sequences associated with the cyclic graph C_r and the complete graph K_r. Fourier techniques are used to characterize the sequences that count walks of length n on both these families of graphs. In the case of the cyclic graph, we show that these sequences are associated with an induced colouring of Pascal's triangle. This extends previous results concerning the Jacobsthal numbers.