Search Results for ""

The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...

Consider a Lucas sequence with P>0 and Q=+/-1. A Fibonacci pseudoprime is a composite number n such that V_n=P (mod n). There exist no even Fibonacci pseudoprimes with ...

The Fibonacci Q-matrix is the matrix defined by Q=[F_2 F_1; F_1 F_0]=[1 1; 1 0], (1) where F_n is a Fibonacci number. Then Q^n=[F_(n+1) F_n; F_n F_(n-1)] (2) (Honsberger ...

The W polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. (The corresponding w polynomials are called Lucas polynomials.) They have explicit ...

A Fibonacci prime is a Fibonacci number F_n that is also a prime number. Every F_n that is prime must have a prime index n, with the exception of F_4=3. However, the converse ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

Let F_n be the nth Fibonacci number. Then the sequence {F_n}_(n=2)^infty={1,2,3,5,8,...} is complete, even if one is restricted to subsequences in which no two consecutive ...

Let psi = 1+phi (1) = 1/2(3+sqrt(5)) (2) = 2.618033... (3) (OEIS A104457), where phi is the golden ratio, and alpha = lnphi (4) = 0.4812118 (5) (OEIS A002390). Define the ...

An n-step Fibonacci sequence {F_k^((n))}_(k=1)^infty is defined by letting F_k^((n))=0 for k<=0, F_1^((n))=F_2^((n))=1, and other terms according to the linear recurrence ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...