The number of subsets of the set [n] containing no two consecutive even integers
From MaRDI portal
Publication:5074048
Recommendations
Cites work
- A new approach to generalized Fibonacci and Lucas numbers with binomial coefficients
- Combinatorial sums of generalized Fibonacci and Lucas numbers.
- Complementary Families of the Fibonacci-Lucas Relations
- Fibonacci and Lucas numbers with applications. Volume I
- scientific article; zbMATH DE number 1200329 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- On the number of summands in Zeckendorf decompositions
- On the properties of Lucas numbers with binomial coefficients
- The generalized k-Fibonacci and k-Lucas numbers.
Cited in
(3)
This page was built for publication: The number of subsets of the set \([n]\) containing no two consecutive even integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074048)