Solutions of certain meta-Fibonacci recurrences

DOI10.4064/AA220613-19-1arXiv2204.04011MaRDI QIDQ6091850FDOQ6091850

Authors: Bartosz Sobolewski, Maciej Ulas 

Publication date: 21 November 2023

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $nleq1$, we prove that the resulting integer sequence is closely related to the function counting binary partitions of a certain type.

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

Recommendations

• A combinatorial problem solved by a meta-Fibonacci recurrence relation
• Trees and meta-Fibonacci sequences
• Linear recurrent subsequences of generalized meta-Fibonacci sequences
• scientific article; zbMATH DE number 5577875
• Meta-Fibonacci sequences, binary trees and extremal compact codes

zbMATH Keywords

automatic sequencebinary partitionsmeta-Fibonacci sequencerecurrence sequence

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Automata sequences (11B85)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Isoperimetric Problem and Meta-fibonacci Sequences

This page was built for publication: Solutions of certain meta-Fibonacci recurrences

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