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
(16)- A framework for an ICT-based study of parametric integrals
- On a conjecture about generalized \(Q\)-recurrence
- Trees and meta-Fibonacci sequences
- Solving non-homogeneous nested recursions using trees
- Constructing new families of nested recursions with slow solutions
- Isoperimetric Problem and Meta-fibonacci Sequences
- Generalized meta-Fibonacci sequences
- Nested recursions, simultaneous parameters and tree superpositions
- On the solution space of the Golomb recursion
- scientific article; zbMATH DE number 775615 (Why is no real title available?)
- A combinatorial problem solved by a meta-Fibonacci recurrence relation
- Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers
- A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
- A family of meta-Fibonacci sequences defined by variable-order recursions
- Solutions of certain meta-Fibonacci recurrences
- Meta-automatic sequences
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)