Optimal pebbling of complete binary trees and a meta-Fibonacci sequence
arXiv:2109.07328
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.