DOAJ Open Access 2006

Complete k-ary trees and generalized meta-Fibonacci sequences

Chris Deugau Frank Ruskey

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (2)

Chris Deugau

Frank Ruskey

Format Sitasi

APA MLA BibTeX

Deugau, C., Ruskey, F. (2006). Complete k-ary trees and generalized meta-Fibonacci sequences. https://doi.org/10.46298/dmtcs.3514

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3514

Informasi Jurnal

Tahun Terbit: 2006
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3514
Akses: Open Access ✓