On square Tribonacci Lucas numbers
Copyright policy )On square Tribonacci Lucas numbers
The Tribonacci-Lucas sequence {Sn}{Sn} is defined by the recurrence relation Sn+3=Sn+2+Sn+1+SnSn+3=Sn+2+Sn+1+Sn with S0=3, S1=1, S2=3.S0=3, S1=1, S2=3. In this note, we show that 11 is the only perfect square in Tribonacci-Lucas sequence for n≢1(mod32)n≢1(mod32) and n≢17(mod96).n≢17(mod96).
- Niğde University Turkey
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
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
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!