Complete k-ary trees and generalized meta-Fibonacci sequences
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 sequ...
Main Authors: | Chris Deugau, Frank Ruskey |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2006-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3514/pdf |
Similar Items
-
A Cross Entropy Algorithm for Classification with $\delta$−Patterns
by: Gabriela Alexe, et al.
Published: (2006-01-01) -
Left and right length of paths in binary trees or on a question of Knuth
by: Alois Panholzer
Published: (2006-01-01) -
Influence of the tie-break rule on the end-vertex problem
by: Pierre Charbit, et al.
Published: (2014-07-01) -
Convex hull for intersections of random lines
by: Daniel Berend, et al.
Published: (2005-01-01) -
Limit distribution of the size of the giant component in a web random graph
by: Yuri Pavlov
Published: (2006-01-01)