Optimal pebbling of complete binary trees and a meta-Fibonacci sequence
Combinatorics
2021-09-16 v1
Abstract
In this paper, we present a new method for determining the optimal pebbling number of a complete binary tree. This method reveals a curious connection between the optimal pebbling numbers of complete binary trees and the Conolly-Fox sequence, a type of meta-Fibonacci sequence.
Keywords
Cite
@article{arxiv.2109.07328,
title = {Optimal pebbling of complete binary trees and a meta-Fibonacci sequence},
author = {Thomas M. Lewis and Fabian Salinas},
journal= {arXiv preprint arXiv:2109.07328},
year = {2021}
}