I'm Thomas Olson and I'm writing a proof on the Fibonacci sequence generator.

The function can be

applied to other sequences. This is not limited to these sequences. I've seen it used in Chebyshev
Polynomials. The function has the following form.

This if offtopic but I kind of mentioned it so I should probably include it. The Chebyshev Polynomial
functions.

Tn

Un

In the rest of the thesis 'e' and 'g' are the two solutions from a quadratic equation rather than
polynomials. I suppose I should look further into the potential for polynomial generation but for now I'm
going to focus on integer sequences. As for the 'h', it is something that needs to be figured out.
This thesis will be heavily based on the quadratic formula

I will first talk about the Fibonacci sequence which is generated by Phi. Since Phi seems to be such a
super star.

'e' and 'g' have been explained. 'h' will take some work. In the case of integers you want to make 'h' and
'n' equal to 1, then normalize the function. If you're doing a polynomial, you'll want to leave an x behind.
'h' will need some explaining but fist I need to talk about 'n'. In this particular example ' ' and ' ' can
be simplified in terms of 'e'.

Now you're probably wondering about 'g', and yes 'g' can be simplied in exactly the same way. 'e' and 'g'
have almost the same simplification, with the exception of ' '.
There is a point of interest between ' ' and the simplification. Polynomials are being made, solutions
first. Although it is not really part of this thesis.

Fibonacci numbers are making an appearance in the simplifications in the form:

In the case of Phi and a special case of Metallic Mean numbers this form is consistent. In all other cases
the second part will subtract itself as you see below.

So lets find 'h', we'll start with and I'll get to 'h' later.

So now that we got that out of the way, what is 'h'? I started by saying this has to do with the quadratic
function.

Knowing this you can generate any number of sequences or polynomials. The coefficients have some
interesting sequences, just change 'n' and see for yourself.

Perhaps the Chebyshev Polynomials of the second kind are a case where 'a' is 1, 'b' is x and 'c' is 1/4.

It's not exactly a Chebyshev Polynomial of the Second Kind. Just multiply it by 8.