Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Complete k-ary trees ...
Conference paper

Complete k-ary trees and generalized meta-Fibonacci sequences

Chris Deugau (1), Frank Ruskey (1)
(1) Department of Computer Science [Victoria]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2005
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Proceedings
DOI
10.46298/dmtcs.3514
License
https://about.hal.science/hal-authorisation-v1
Natural Sciences and Engineering Research Council of Canada
Indicators
694
Views
1459
Downloads

Complete k-ary trees and generalized meta-Fibonacci sequences

Chris Deugau (1), Frank Ruskey (1)
(1) Department of Computer Science [Victoria]
Abstract
We show that a family of generalized meta-Fibonacci sequences arise when counting the number of leaves at the largest level in certain infinite sequences of k-ary trees and restricted compositions of an integer. For this family of generalized meta-Fibonacci sequences and two families of related sequences we derive ordinary generating functions and recurrence relations.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]
  • Meta-Fibonacci sequence
  • k-ary tree
  • recurrence relation
  • generating function
  • ruler function.
Cited by

Source: OpenCitations

  • A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion

    The Journal of Difference Equations and Applications

    Authors : M. Sunohara, S. Tanny, Y. Verberne ORCID

    Journal reference : Volume 25, 2019, pp. 481-503

    DOI : 10.1080/10236198.2019.1582648
  • On Cloitre’s hiccup sequences

    The Ramanujan Journal

    Authors : Robbert Fokkink ORCID, Gandhar Joshi

    Journal reference : Volume 69, 2026, pp.

    DOI : 10.1007/s11139-025-01305-1
Preview
Loading PDF preview...