Irmak, NurettinSzalay, Laszlo2019-08-012019-08-0120160025-55211903-1807https://hdl.handle.net/11480/3794We 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.eninfo:eu-repo/semantics/closedAccessArticle11812732WOS:000375734200003Q3