A Combinatorial Problem Solved by a Meta-Fibonacci Recurrence Relation
Combinatorics
2019-02-11 v1
Abstract
We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation , where 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.
Cite
@article{arxiv.1902.02929,
title = {A Combinatorial Problem Solved by a Meta-Fibonacci Recurrence Relation},
author = {Ramin Naimi and Eric Sundberg},
journal= {arXiv preprint arXiv:1902.02929},
year = {2019}
}