Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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 : Meta-Fibonacci sequence k-ary tree recurrence relation generating function ruler function.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
https://hal.inria.fr/hal-01184719
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 17, 2015 - 4:24:01 PM
Last modification on : Friday, June 1, 2018 - 3:24:01 PM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:11:34 PM

File

Vignette du document
dmAG0113.pdf
Publisher files allowed on an open archive

Identifiers

Collections

INSMI | TDS-MACS

Citation

Chris Deugau, Frank Ruskey. Complete k-ary trees and generalized meta-Fibonacci sequences. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.203-214, ⟨10.46298/dmtcs.3514⟩. ⟨hal-01184719⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

69

Files downloads

441

 

Contact                    Legal Notice                    Personal Data