{
  "id": "2109.07328",
  "version": "v1",
  "published": "2021-09-15T14:36:06.000Z",
  "updated": "2021-09-15T14:36:06.000Z",
  "title": "Optimal pebbling of complete binary trees and a meta-Fibonacci sequence",
  "authors": [
    "Thomas M. Lewis",
    "Fabian Salinas"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-09-15T14:36:06.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C05"
    ],
    "keywords": [
      "complete binary tree",
      "meta-fibonacci sequence",
      "optimal pebbling number",
      "conolly-fox sequence",
      "curious connection"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}