Irmak, N.Alp, M.2024-11-072024-11-0720170231-69860862-9544https://hdl.handle.net/11480/14203The k-generalized Fibonacci sequence {F-n((k))}(n >= 0) is defined as the sum of the k proceeding terms and initial conditions are 0, ..., 0, 1 (k terms). In this paper, we solve the diophantine equation F-n((k)) = 2(a) + 3(b) + 5(c) + delta, where a, b, c and delta are nonnegative integers with max {a, b} <= c and 0 <= delta <= 5. This work generalizes a recent Marques [9] and the first author, Szalay [6] results.eninfo:eu-repo/semantics/closedAccessk-generalized Fibonacci sequencelinear forms in logarithmsreduction methodArticle862279286WOS:000410994400008N/A