References
- Benjamin, A., Quinn, J. (2003). Proofs that Really Count. Washington, DC: Math. Assoc. Amer.
- Brualdi, R. (2010). Introductory Combinatorics, 5th ed. Upper Saddle River: Pearson Prentice Hall.
- Choi, E., Jo, J. (2015). On partial sum of Tribonacci numbers, Int. J. Math. Math. Sci., Art. ID 301814. DOI: 10.1155/2015/301814.
- Frontczak, R. (2018). Sums of Tribonacci and Tribonacci-Lucas numbers. Int. J. Math. Math. Anal. 12(1): 19–24. DOI: 10.12988/ijma.2018.712153.
- Hansen, R. (1972). Generating Identities for Fibonacci and Lucas triples, Fib. Quart. 10: 571–578. DOI: 10.12988/ijma.2018.712153.
- Horn, R., Johnson, C. (1991). Topics in matrix analysis. Cambridge: Cambridge Univ. Press.
- Kiliç, E. (2008). Tribonacci sequences with certain indices and their sums, Ars Combin. 86: 13–22.
- Koshy, T. (1998). New Fibonacci and Lucas identities, Math. Gazette 82(495): 481–484. DOI: 10.2307/3619903.
- Koshy, T. (2000). Weighted Fibonacci and Lucas sums, Math. Gazette 85(502): 93–96. DOI: 10.2307/3620481.
- Koshy, T. (2001). Fibonacci and Lucas Numbers with Applications. New York: Wiley-Interscience.
- Niven, I. (1969). Formal power series. Amer. Math. Monthly 76(8): 871–889. DOI: 10.1080/00029890.1969.12000359.
- Stanley, R. (2012). Enumerative Combinatorics, Vol. 1, 2nd ed. Cambridge: Cambridge Univ. Press.
- Wilf, H. (2006). generatingfunctionology, 3rd ed. Wellesley: A. K. Peters, Ltd.
- Yuan, Q. (2017). Algorithm for computing Hadamard product of two rational generating functions. Available at: https://math.stackexchange.com/q/2520666. Last accessed September 2022.