Problem 58946. Count block fountains

• Created by ChrisR
• Appears in YouTube-inspired

×

Like (1)

Difficulty:

(6)

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

• Triangle Numbers

  28698 Solvers

• Bullseye Matrix

  5999 Solvers

• Remove the two elements next to NaN value

  662 Solvers

• Numbers in extended form

  104 Solvers

• Too Many Zeros, Dump Them!

  252 Solvers

More from this Author298

• Solve a nonlinear difference equation

  21 Solvers

• List the two-bit primes

  9 Solvers

• Determine whether a player solved a Cody problem

  3 Solvers

• Investigate the frequency of last non-zero digits of primorials

  11 Solvers

• Identify eban numbers

  18 Solvers