A combinatorial approach for solving certain nested recursions with non-slow solutions

DOI10.1080/10236198.2012.662967zbMath1262.05028arXiv1202.0276OpenAlexW2030947627MaRDI QIDQ4916372

Abraham Isgur, Vitaly Kuznetsov, Stephen M. Tanny

Publication date: 22 April 2013

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

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

zbMATH Keywords

nested recursionslowly growing sequenceGolomb triangular recursionnon-homogeneous Conolly recursion

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

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

Uses Software

• OEIS

Cites Work

• Solving non-homogeneous nested recursions using trees
• On the Behavior of a Family of Meta-Fibonacci Sequences
• Unnamed Item

This page was built for publication: A combinatorial approach for solving certain nested recursions with non-slow solutions