Problem 52849. Easy Sequences 34: Modified Pascal's Triangle
Consider the integer triangle below:
It follows the same rule as Pascal's Triangle, except that instead of affixing 1's at the sides of each row, the row number minus 1, is affixed (on first row 0 is affixed; at row 2, 1 is affixed on each side, etc.). Any inner number, as in Pascal's Triangle, is the sum of the left and right numbers on its previous row.
Given a number n find , which is the sum of the n-th row. Hence, and .
We could be getting large numbers here, therefore please concatenate the total number of digits with the last 3 digits of and output a single concatenated integer. For example the , hence the output should be .
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers8
Suggested Problems
-
Find the stride of the longest skip sequence
148 Solvers
-
71 Solvers
-
Number of 1s in a binary string
8068 Solvers
-
147 Solvers
-
Implement a bubble sort technique and output the number of swaps required
260 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!