Easy Sequences 80: Sum of the n-th Row of Fibonacci Square Triangle - MATLAB Cody - MATLAB Central

Problem 56458. Easy Sequences 80: Sum of the n-th Row of Fibonacci Square Triangle

Difficulty:
(2)
Rate
We shall call the following arrangement of Fibonacci numbers, as the Fibonacci Square Triangle:
where: and for .
We can see from the above list, that the first row contains the square of the first Fibonacci number (i.e. ), the 2nd row contains the squares of the next 2 Fibonacci numbers, the 3rd contains the next 3, the 4th contains the next 4, and so on.
In this problem, we are required to find the sum of the n-th row of the Fibonacci Square Triangle. For example for the 4th row, the sum is:
Since, Fibonacci number squares grows very fast, please present your answer as a row vector of 3 elements. The first element is the first 4 digits of the sum, the second element is the last 4 digits of the sum, and last element is the number of digits of the sum.
Therefore, for the 4th row, your program output should be .
Solve

Solution Stats

40.0% Correct | 60.0% Incorrect
Last Solution submitted on Mar 20, 2025

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers2

Suggested Problems

More from this Author116

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page