A combinatorial problem solved by a meta-Fibonacci recurrence relation

MaRDI QIDQ5244181zbMATH OpenFDO

Authors Ramin Naimi, Eric Sundberg

Publication date 20 November 2019

Full work available at URL https://arxiv.org/abs/1902.02929, http://math.colgate.edu/~integers/t53/t53.pdf

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n)=su{m}_{i=1}^{p}a(n-i+1-a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3] (B. Jackson, F. Ruskey, 2006) and [4] (F. Ruskey, C. Deugau, 2009), but it has the advantage of having a simpler statement.

Recommendations

• scientific article; zbMATH DE number 5577875
• Linear recurrent subsequences of generalized meta-Fibonacci sequences
• Trees and meta-Fibonacci sequences
• Generalized meta-Fibonacci sequences
• On the Behavior of a Family of Meta-Fibonacci Sequences

Cites work

• scientific article; zbMATH DE number 5577875 (Why is no real title available?)
• scientific article; zbMATH DE number 637308 (Why is no real title available?)
• Meta-Fibonacci sequences, binary trees and extremal compact codes
• On the Behavior of a Family of Meta-Fibonacci Sequences

Cited in

(2)

• scientific article; zbMATH DE number 5577875 (Why is no real title available?)
• Solutions of certain meta-Fibonacci recurrences

This page was built for publication: A combinatorial problem solved by a meta-Fibonacci recurrence relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244181)