Meta-Fibonacci sequences, binary trees and extremal compact codes
From MaRDI portal
Abstract: We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this family of meta-Fibonacci sequences and two families of related sequences we derive ordinary generating functions and recurrence relations. Included in these families of sequences are several well-known sequences in the Online Encyclopedia of Integer Sequences (OEIS).
Recommendations
Cited in
(15)- A family of meta-Fibonacci sequences defined by variable-order recursions
- A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
- A combinatorial problem solved by a meta-Fibonacci recurrence relation
- Trees and meta-Fibonacci sequences
- Nested recursions, simultaneous parameters and tree superpositions
- Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers
- Constructing new families of nested recursions with slow solutions
- Isoperimetric Problem and Meta-fibonacci Sequences
- scientific article; zbMATH DE number 775615 (Why is no real title available?)
- Generalized meta-Fibonacci sequences
- Solutions of certain meta-Fibonacci recurrences
- Solving non-homogeneous nested recursions using trees
- On a conjecture about generalized \(Q\)-recurrence
- A framework for an ICT-based study of parametric integrals
- On the solution space of the Golomb recursion
This page was built for publication: Meta-Fibonacci sequences, binary trees and extremal compact codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819188)