View in EDS

Equidistant integer grids as integer sequence generators

Saved in:
Bibliographic Details
Title: Equidistant integer grids as integer sequence generators
Authors: Kolarec, Biserka
Source: Mathematical communications. 30(30):259-264
Publisher Information: 2025.
Publication Year: 2025
Subject Terms: arithmetic sequence, recurrence relations, integer semigrids, integer grids
Description: 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.
Document Type: Article
ISSN: 1331-0623
Accession Number: edsair.dris...01492..8c0d8d83e73eb026b74e938f28cff738
Database: OpenAIRE
Description
Abstract: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.
ISSN:13310623