Problem 60271. Hofstadter G sequence

• Created by minnolina

×

Like (0)

Difficulty:

(10)

Rate

• Solve Later   
• Add To GroupÂ

The Hofstadter G sequence is defined as follows:

The first elements of the sequence are 0, 1, 1, 2, 3, 3, 4, 4, 5, 6.

Write a function to compute for a given n.

See https://oeis.org/A005206

Solve

Solution Stats

33.33% Correct | 66.67% Incorrect

• 39 Solutions
• 10 Solvers

Last Solution submitted on Feb 11, 2025

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 Solvers10

Suggested Problems

• Wind outward from the center ...

  84 Solvers

• Replace all zeros and NaNs in a matrix with the string 'error'

  100 Solvers

• Bit Reversal

  1479 Solvers

• Volume of a Simplex

  94 Solvers

• Sum the 'edge' values of a matrix

  360 Solvers

More from this Author53

• Integer Persistence, Product

  13 Solvers

• Largest Rectangle Area in a Histogram

  6 Solvers

• Merge two integers

  17 Solvers

• Find the nearest value to the given one

  34 Solvers

• Finding the Most Frequent Letter in a Text

  12 Solvers