Problem 58946. Count block fountains

• Created by ChrisR
• Appears in Matrix Patterns II

×

Like (1)

Difficulty:

(44)

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

53.33% Correct | 46.67% Incorrect

• 15 Solutions
• 6 Solvers

Last Solution submitted on Jul 16, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers6

Suggested Problems

• Create a vector whose elements depend on the previous element

  726 Solvers

• Replace pattern 0 1 0 and 1 0 1

  147 Solvers

• Find similar sequences

  114 Solvers

• Combined Ages 2 - Symmetric, n ≥ 3

  134 Solvers

• Approximate e

  59 Solvers

More from this Author302

• Compute head profiles for steady 1D flow through soils in series

  1 Solvers

• List the dopey numbers

  10 Solvers

• Add 100

  13 Solvers

• Identify prime words

  16 Solvers

• Flip the parity of digits in a decimal expansion

  5 Solvers