Hosoya's triangle

From Wikipedia, the free encyclopedia
(Redirected from Fibonacci triangle)
Jump to navigation Jump to search

Hosoya's triangle or the Hosoya triangle (originally Fibonacci triangle; OEISA058071) is a triangular arrangement of numbers (like Pascal's triangle) based on the Fibonacci numbers. Each number is the sum of the two numbers above in either the left diagonal or the right diagonal.[1]

1112123223534358566581381091081321131615151613213421262425242621345534423940403942345589556863656465636855891448911010210510410410510211089144
A diagram showing the first 12 rows of Hosoya's triangle

The name "Fibonacci triangle" has also been used for triangles composed of Fibonacci numbers or related numbers[2] or triangles with Fibonacci sides and integral area,[3] hence is ambiguous.

Recurrence

[edit | edit source]

The numbers in this triangle obey the recurrence relations

H(0,0)=H(1,0)=H(1,1)=H(2,1)=1

and

H(n,j)=H(n1,j)+H(n2,j)=H(n1,j1)+H(n2,j2).

Relation to Fibonacci numbers

[edit | edit source]

The entries in the triangle satisfy the identity

H(n,i)=F(i+1)F(ni+1)

Thus, the two outermost diagonals are the Fibonacci numbers, while the numbers on the middle vertical line are the squares of the Fibonacci numbers. All the other numbers in the triangle are the product of two distinct Fibonacci numbers greater than 1. The row sums are the first convolved Fibonacci numbers.[4]

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).