Problem 58946. Count block fountains

Created by ChrisR
Appears in Prime Numbers III

Difficulty:Rate

Solve Later
Add To GroupÃ‚

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. 

Solve

Solution Stats

15 Solutions
6 Solvers

Last Solution submitted on Jul 16, 2024

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

William on 3 Sep 2023

I believe there is an error in test 9. The last digit should be 3 rather than 5.

ChrisR on 3 Sep 2023

Yes, you're right. I double-counted two of the configurations. ;-)

Solution Comments

Show comments

Problem Recent Solvers6

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 58946. Count block fountains

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers6

Suggested Problems

More from this Author291

Problem Tags

Community Treasure Hunt

Problem 58946. Count block fountains

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers6

Suggested Problems

More from this Author291

Problem Tags

Community Treasure Hunt

Players