Generalized meta-Fibonacci sequences
From MaRDI portal
Publication:3574993
zbMATH Open1190.11008MaRDI QIDQ3574993FDOQ3574993
Authors: Chris Deugau, Frank Ruskey
Publication date: 5 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAG0113/0.html
Recommendations
Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cited In (10)
- Title not available (Why is that?)
- Meta-Fibonacci sequences, binary trees and extremal compact codes
- Linear recurrent subsequences of generalized meta-Fibonacci sequences
- A family of meta-Fibonacci sequences defined by variable-order recursions
- Trees and meta-Fibonacci sequences
- On the Behavior of a Family of Meta-Fibonacci Sequences
- Return times of polynomials as meta-Fibonacci numbers
- Constructing new families of nested recursions with slow solutions
- Spot-based generations for meta-Fibonacci sequences
- A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
This page was built for publication: Generalized meta-Fibonacci sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574993)