EN
TR
Number of Subsets of the Set [n] Including No Three Consecutive Odd Integers.
Abstract
For every natural number, let the sequence enumerate the number of subsets S of the set {1,2, . . . ,n } including no three consecutive odd integers. We give the generating function and the closed form formula of the sequence obtaining sixth order linear homogeneous recurrence relation with constant coefficients of the integer sequence. The sequence is associated with the Tribonacci sequence. The combinatorial representation of the sequence is obtained and limit of the ratios of consecutive terms of the sequence is found.
Keywords
Kaynakça
- Bueno, A. C. F. (2015). A note on generalized Tribonacci sequence, Notes on Number Theory and Discrete Mathematics, 21, 67-69.
- Feinberg, M. (1963). Fibonacci–Tribonacci, Fibonacci Quarterly, 1, 71–74.
- Pethe, S. (1988). Some Identities for Tribonacci sequences, Fibonacci Q., 26, 144–151.
- Ramirez, J. L. and Sirvent, V. F. (2014), Incomplete Tribonacci numbers and polynomials, Journal of Integer Sequences, 17 Article 14.4.2.
- Shannon, A. (1977). Tribonacci numbers and Pascal’s pyramid, Fibonacci Q., 15, 268–275.
- Spickerman, W. and Joyner, R. N. Binets’s formula for the Recursive sequence of Order K, Fibonacci Q., 22, 327–331.
- Spickerman, W. (1982). Binet’s formula for the Tribonacci sequence, Fibonacci Q., 20, (118-120).
- Wilf, H. S. (1990). Generatingfunctionology, Academic Press.
Ayrıntılar
Birincil Dil
İngilizce
Konular
Mühendislik
Bölüm
Araştırma Makalesi
Yayımlanma Tarihi
30 Kasım 2021
Gönderilme Tarihi
23 Eylül 2021
Kabul Tarihi
24 Eylül 2021
Yayımlandığı Sayı
Yıl 2021 Sayı: 28
APA
Arslan, B., & Uslu, K. (2021). Number of Subsets of the Set [n] Including No Three Consecutive Odd Integers. Avrupa Bilim ve Teknoloji Dergisi, 28, 352-356. https://doi.org/10.31590/ejosat.999521
Cited By
Tribonacci Sayıları ile İlişkili Bir Tamsayı Dizisininin Genellemesi
European Journal of Science and Technology
https://doi.org/10.31590/ejosat.1144208