Number of Subsets of the Set [n] Including No Three Consecutive Odd Integers.

Yıl 2021, Sayı: 28, 352 - 356, 30.11.2021

Barış Arslan Kemal Uslu

https://doi.org/10.31590/ejosat.999521

Cited By: 1

Öz

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.

Anahtar Kelimeler

Tribonacci sequence, Consecutive odd integers, Generating function, Combinatorial representation

[n] Kümesinin Ardışık Üç Tam Sayı İçermeyen Alt Kümelerinin Sayısı

Öz

Her doğal sayı için, {1,2, . . . ,n } kümesinin ardışık üç tek tam sayı içermeyen S alt kümelerinin sayısını veren tam sayı dizisini ele alalım . Dizinin altıncı dereceden sabit katsayılı lineer homojen rekürans bağıntısını elde ederek dizinin üreteç fonksiyonunu ve kapalı form formülünü verdik. Dizi Tribonacci sayı dizisi ile ilişkilendirildi. Dizinin kombinatoryal gösterimi elde edildi ve dizinin ardışık terimlerinin oranlarının limiti bulundu.

Anahtar Kelimeler

Tribonacci dizisi, Ardışık tek sayılar, Üreteç fonksiyon, Kombinatoryal gösterim

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.
• Yalavigi, C. C. (1972), Properties of Tribonacci numbers, Fibonacci Quarterly, 10 231–246.
• Yilmaz, N. and Taskara, N. (2014). Tribonacci and Tribonacci-Lucas Numbers via the Determinants of Special Matrices, Appl. Math. Sci., 8(39), 1947–1955.