We investigate equidistant integer grids and semigrids as generators of integer sequences. Equidistant integer grids consist of arithmetic sequences arranged in rows and columns. Among other things, the partial sums of their diagonal elements result in polygonal and second polygonal numbers. Furthermore, sequences of row sums in integer semigrids fulfill certain recurrence relations. We analyze such sequences in detail for Pascal’s semigrid obtained in two ways: by shifting columns only and by stretching and shifting columns.