Solving non-homogeneous nested recursions using trees

DOI10.1007/S00026-013-0202-9zbMath1328.05016arXiv1105.2351OpenAlexW2037416325MaRDI QIDQ2441387

Abraham Isgur, Mustazee Rahman, Stephen M. Tanny

Publication date: 24 March 2014

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.2351

zbMATH Keywords

meta-Fibonacci sequenceConolly sequencenon-homogeneous nested recursion

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Recurrences (11B37)

Related Items (5)

Nested recursions, simultaneous parameters and tree superpositions ⋮ A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion ⋮ A combinatorial approach for solving certain nested recursions with non-slow solutions ⋮ On the solution space of the Golomb recursion ⋮ Connecting slow solutions to nested recurrences with linear recurrent sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Meta-Fibonacci sequences, binary trees and extremal compact codes
• A well-behaved cousin of the Hofstadter sequence
• Trees and meta-Fibonacci sequences
• Nested Recurrence Relations with Conolly-like Solutions
• A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence
• On the Behavior of a Family of Meta-Fibonacci Sequences

This page was built for publication: Solving non-homogeneous nested recursions using trees