EN
TR
The Polynomial Sequence Generalizing the Integer Sequence which Enumerates the Number of Subsets of the Set [n] Including No Two Consecutive Even Integers
Abstract
Fibonacci polynomial sequence is an extension of Fibonacci sequence. Here we define a polynomial sequence generalizing the integer sequence which enumerates the number of subsets of the set [n] including no two consecutive even integers. The polynomial sequence is associated with the Fibonacci polynomials. Some basic properties of the polynomial sequence are obtained.
Keywords
Kaynakça
- Andrews, G.E. (2004). Fibonacci numbers and the Rogers-Ramanujan identities, Fibonacci Quarterly, 42(1), 3–19.
- Arslan B. (2016). Sequence A279312 in The On-Line Encyclopedia of Integer Sequences, published electronically at https://oeis.org.
- Falcon, S. and Plaza, A. (2009). On k-Fibonacci sequences and polynomials and their derivatives, Chaos Solitions and Fractals, 39, 1005-1019.
- Hoggatt, Jr. V.E., Bicknell, M. (1973). Generalized Fibonacci polynomials, Fibonacci Quarterly, 11(5), 457-465.
- Koshy, T. (2011). Fibonacci and Lucas Numbers with Applications, Wiley Interscience Publications, New York.
- Uslu, K. and Arslan B. (2021). The number of subsets of the set [n] containing no two consecutive even integers, JP Journal of Algebra Number Theory and Applications, 52(2), 243-254.
Ayrıntılar
Birincil Dil
İngilizce
Konular
Mühendislik
Bölüm
Araştırma Makalesi
Yayımlanma Tarihi
31 Mart 2022
Gönderilme Tarihi
24 Şubat 2022
Kabul Tarihi
2 Mart 2022
Yayımlandığı Sayı
Yıl 2022 Sayı: 34
APA
Arslan, B., & Uslu, K. (2022). The Polynomial Sequence Generalizing the Integer Sequence which Enumerates the Number of Subsets of the Set [n] Including No Two Consecutive Even Integers. Avrupa Bilim ve Teknoloji Dergisi, 34, 164-169. https://doi.org/10.31590/ejosat.1078691