Zobrazit v EDS

Equidistant integer grids as integer sequence generators

Uloženo v:
Podrobná bibliografie
Název: Equidistant integer grids as integer sequence generators
Autoři: Kolarec, Biserka
Zdroj: Mathematical communications. 30(30):259-264
Informace o vydavateli: 2025.
Rok vydání: 2025
Témata: arithmetic sequence, recurrence relations, integer semigrids, integer grids
Popis: 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.
Druh dokumentu: Article
ISSN: 1331-0623
Přístupové číslo: edsair.dris...01492..8c0d8d83e73eb026b74e938f28cff738
Databáze: OpenAIRE
Popis
Abstrakt: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