用交替方法求四数列的Binet型公式

Gautam S. Hathiwala, D. V. Shah
{"title":"用交替方法求四数列的Binet型公式","authors":"Gautam S. Hathiwala, D. V. Shah","doi":"10.15415/mjis.2017.61004","DOIUrl":null,"url":null,"abstract":"The sequence {Tn} of Tetranacci numbers is defined by recurrence relation Tn= Tn-1 + Tn-2 + Tn-3 + Tn-4; n≥4 with initial condition T0=T1=T2=0 and T3=1. In this Paper, we obtain the explicit formulla-Binet-type formula for Tn by two different methods. We use the concept of Eigen decomposition as well as of generating functions to obtain the result.","PeriodicalId":166946,"journal":{"name":"Mathematical Journal of Interdisciplinary Sciences","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Binet – Type Formula For The Sequence of Tetranacci Numbers by Alternate Methods\",\"authors\":\"Gautam S. Hathiwala, D. V. Shah\",\"doi\":\"10.15415/mjis.2017.61004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The sequence {Tn} of Tetranacci numbers is defined by recurrence relation Tn= Tn-1 + Tn-2 + Tn-3 + Tn-4; n≥4 with initial condition T0=T1=T2=0 and T3=1. In this Paper, we obtain the explicit formulla-Binet-type formula for Tn by two different methods. We use the concept of Eigen decomposition as well as of generating functions to obtain the result.\",\"PeriodicalId\":166946,\"journal\":{\"name\":\"Mathematical Journal of Interdisciplinary Sciences\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Journal of Interdisciplinary Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15415/mjis.2017.61004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Journal of Interdisciplinary Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15415/mjis.2017.61004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

Tetranacci数的序列{Tn}定义为递归关系Tn= Tn-1 + Tn-2 + Tn-3 + Tn-4;n≥4,初始条件T0=T1=T2=0, T3=1。本文用两种不同的方法得到了Tn的显式公式- binet型公式。我们使用了特征分解和生成函数的概念来得到结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Binet – Type Formula For The Sequence of Tetranacci Numbers by Alternate Methods
The sequence {Tn} of Tetranacci numbers is defined by recurrence relation Tn= Tn-1 + Tn-2 + Tn-3 + Tn-4; n≥4 with initial condition T0=T1=T2=0 and T3=1. In this Paper, we obtain the explicit formulla-Binet-type formula for Tn by two different methods. We use the concept of Eigen decomposition as well as of generating functions to obtain the result.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信