TRIBONACCI NUMBERS CLOSE TO THE SUM 2(a)+3(b)+5(c)

dc.contributor.authorIrmak, Nurettin
dc.contributor.authorSzalay, Laszlo
dc.date.accessioned2019-08-01T13:38:39Z
dc.date.available2019-08-01T13:38:39Z
dc.date.issued2016
dc.departmentNiğde ÖHÜ
dc.description.abstractWe show that there are exactly 22 solutions to the inequalities 0 <= T-n - 2(a) - 3(b) - 5(c) <= 10, where T-n denotes the nth term (n >= 0) of the Tribonacci sequence, and 0 <= a, b <= c are integers. All the solutions are explicitly determined.
dc.identifier.endpage32
dc.identifier.issn0025-5521
dc.identifier.issn1903-1807
dc.identifier.issue1
dc.identifier.startpage27
dc.identifier.urihttps://hdl.handle.net/11480/3794
dc.identifier.volume118
dc.identifier.wosWOS:000375734200003
dc.identifier.wosqualityQ3
dc.indekslendigikaynakWeb of Science
dc.institutionauthor[0-Belirlenecek]
dc.language.isoen
dc.publisherMATEMATISK INST
dc.relation.ispartofMATHEMATICA SCANDINAVICA
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.titleTRIBONACCI NUMBERS CLOSE TO THE SUM 2(a)+3(b)+5(c)
dc.typeArticle

Dosyalar