Problem 58946. Count block fountains

• Created by ChrisR

×

Like (1)

Difficulty:

(47)

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

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers6

Suggested Problems

• Find the sum of all the numbers of the input vector

  50732 Solvers

• Getting the indices from a matrix

  661 Solvers

• Get the elements of diagonal and antidiagonal for any m-by-n matrix

  485 Solvers

• Kepler's Equation

  154 Solvers

• An asteroid and a spacecraft

  161 Solvers

More from this Author297

• Describe n from right to left

  7 Solvers

• Compute the harmonic numbers

  83 Solvers

• Compute the sum of distances from a point to the sides of an equilateral triangle

  6 Solvers

• Count collisions in an idealized block system

  6 Solvers

• Compute the unitary totient of a number

  4 Solvers