Equidistant integer grids as integer sequence generators

Gespeichert in:
Bibliographische Detailangaben
Titel: Equidistant integer grids as integer sequence generators
Autoren: Kolarec, Biserka
Quelle: Mathematical communications. 30(30):259-264
Verlagsinformationen: 2025.
Publikationsjahr: 2025
Schlagwörter: arithmetic sequence, recurrence relations, integer semigrids, integer grids
Beschreibung: 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.
Publikationsart: Article
ISSN: 1331-0623
Dokumentencode: edsair.dris...01492..8c0d8d83e73eb026b74e938f28cff738
Datenbank: OpenAIRE
Beschreibung
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