Problem 58946. Count block fountains
A block fountain consists of rows of circles in which each row is a continuous block of circles (i.e., adjacent circles are tangent) and each circle in a row above the first touches exactly two circles on the previous row.
Write a function to compute the number of block fountains with n circles on the first row. For example, there are five block fountains with three circles on the first row.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers6
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1229 Solvers
-
Remove the two elements next to NaN value
682 Solvers
-
It's going down. We're finding simbers!
81 Solvers
-
474 Solvers
-
62 Solvers
More from this Author314
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!