Article contents
Ordered Fibonacci Partitions
Published online by Cambridge University Press: 20 November 2018
Abstract
Ordered partitions are enumerated by Fn = Σk k !S(n, k) where S(n, k) is the Stirling number of the second kind. We give some comments on several papers dealing with ordered partitions and turn then to ordered Fibonacci partitions of {1, ߪ, n}: If d is a fixed integer, the sets A appearing in the partition have to fulfill i, j ∈ A, i ≠ j ⟹ |i-j| ≥ d. The number of ordered Fibonacci partitions is determined.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1983
References
- 3
- Cited by