87 citations · 243 across the 20 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.CO2011★ 8 cited
Solving Non-homogeneous Nested Recursions Using Trees
Abraham Isgur, Mustazee Rahman, Stephen Tanny
The solutions to certain nested recursions, such as Conolly's C(n) = C(n-C(n-1))+C(n-1-C(n-2)), with initial conditions C(1)=1, C(2)=2, have a well-established combinatorial interp…
math.CO2011★ 14 cited
Spot-Based Generations for Meta-Fibonacci Sequences
Barnaby Dalton, Mustazee Rahman, Stephen Tanny
For many meta-Fibonacci sequences it is possible to identify a partition of the sequence into successive intervals (sometimes called blocks) with the property that the sequence beh…
math.CO2011★ 3 cited
A Combinatorial interpretation of Hofstadter's G-sequence
Mustazee Rahman
We give a combinatorial interpretation of a classical meta-Fibonacci sequence defined by G(n) = n - G(G(n-1)) with the initial condition G(1) = 1, which appears in Hofstadter's 'Go…