On square Tribonacci Lucas numbers
No Thumbnail Available
Date
2021
Authors
Irmak, Nurettin
Journal Title
Journal ISSN
Volume Title
Publisher
Hacettepe University
Open Access Color
GOLD
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
The Tribonacci-Lucas sequence {Sn} is defined by the recurrence relation Sn+3 = Sn+2 + Sn+1 + Sn with S0 = 3, S1 = 1, S2 = 3. In this note, we show that 1 is the only perfect square in Tribonacci-Lucas sequence for (Formula presented) (mod 32) and (Formula presented) (mod 96). © 2021, Hacettepe University. All rights reserved.
Description
Keywords
Squares, Tribonacci Lucas sequence, Tribonacci sequence, Matematik, Tribonacci Lucas sequence, Tribonacci sequence, Fibonacci and Lucas numbers and polynomials and generalizations, squares, Mathematical Sciences, Diophantine equations in many variables, Tribonacci sequence;Tribonacci Lucas sequence;squares
Turkish CoHE Thesis Center URL
Fields of Science
0101 mathematics, 01 natural sciences
Citation
WoS Q
Q2
Scopus Q
Q3

OpenCitations Citation Count
N/A
Source
Hacettepe Journal of Mathematics and Statistics
Volume
50
Issue
6
Start Page
1652
End Page
1657
PlumX Metrics
Citations
Scopus : 2
Captures
Mendeley Readers : 1
SCOPUS™ Citations
2
checked on Feb 03, 2026
Web of Science™ Citations
1
checked on Feb 03, 2026
Downloads
1
checked on Feb 03, 2026
Google Scholar™


