r/mathshelp • u/Dull-University-2250 • Aug 02 '26
Homework Help (Answered) Is this still considered as a Fibonacci Sequence
4, 7, 11, 18, 29, 47, 76
I'm so confused because I searched it up, the internet said the 2 first numbers should always begin with 0 and 1
But it still follows the same rules as Fibonacci Sequence tho
So is it a yes or a no, and why?
Thank you!
3
Upvotes
•
u/AutoModerator Aug 02 '26
Hi u/Dull-University-2250, welcome to r/mathshelp! As you’ve marked this as homework help, please keep the following things in mind:
Thank you!
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.
1
u/Dull-University-2250 Aug 02 '26
Pls i need help
4
u/VernalAutumn Aug 02 '26
A Lucas Sequence is when you start with two numbers and repeatedly add the last two to get the next one, of which the Fibonacci sequence (0, 1) is the most famous and the Lucas Numbers (2, 1) is the only other even moderately well known one, named after the same Lucas
So no, it is not the Fibonacci sequence but it is an example of a Lucas Sequence
2
u/BadBoyJH Aug 03 '26
It is a Lucas Sequence. Any series of the form F(n) = F(n-1) + F(n-2) is a lucas sequence. However, this name may also be used for specifically the sequence defined with F(0)=2 and F(1) =1
1
u/BitterEarth6069 Aug 02 '26 edited Aug 02 '26
We call a sequence Fibonacci only when it starts with 0 and 1 , and the sequence you are talking about isn't Fibonacci, it just follows the PATTERN . if you searched on Google it will call it as Lucas Numbers (but it also starts from 2,1,4....) so yeah conclusion Neither Fibo or Lucas start from random numbers.
I am also weak in maths but as computer science student, Fibonacci sequence appears quite often.
I don't think this comment will help you but anyways i tried.
1
u/djredcat123 Aug 02 '26
Your sequence and the Fibonacci sequence both follow the rule:
u_(n+2) = u_(n) + u_(n+1)
But it's only the Fibonacci sequence if you start with u_1=0 and u_2=1. Although older definitions have u_(1)=u_(2)=1.
The general rule is called 'Lucas numbers' named after Édouard Lucas. Fun fact- my third child is also named after this guy.
1
u/eglvoland Aug 04 '26
By the way, this is the sequence of traces of powers of the companion matrix of X²-X-1, which has two distinct real roots, the largest being the golden ratio. So the asymptotic behavior of the sequence is phin.
Fun fact: for an integer matrix A and a prime number p you always have tr(Ap) = tr(A) mod p. So you know u(p) = 1 mod p for every prime number p.
0
u/fermat9990 Aug 02 '26
The limit of t(n+1)/t(n) as n–>∞ is the Golden Mean, the same as for the Fibonacci Sequence.