关于广义类斐波那契数列和矩阵

IF 0.3 Q4 MATHEMATICS Annales Mathematicae et Informaticae Pub Date : 2023-01-01 DOI:10.33039/ami.2023.05.001
K. Prasad, Hrishikesh Mahato
{"title":"关于广义类斐波那契数列和矩阵","authors":"K. Prasad, Hrishikesh Mahato","doi":"10.33039/ami.2023.05.001","DOIUrl":null,"url":null,"abstract":". In this paper, we study the generalized Fibonacci like sequences { 𝑡 𝑘,𝑛 } 𝑘 ∈{ 2 , 3 } ,𝑛 ∈ N with arbitrary initial seed and give some new and well- known identities like Binet’s formula, trace sequence, Catalan’s identity, generating function, etc. Further, we study various properties of these generalized sequences, establish a recursive matrix and relationships with Fibonacci and Lucas numbers and sequence of Fibonacci traces. In this study, we exam-ine the nature of identities and recursive matrices for arbitrary initial values.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"54 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the generalized Fibonacci like sequences and matrices\",\"authors\":\"K. Prasad, Hrishikesh Mahato\",\"doi\":\"10.33039/ami.2023.05.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". In this paper, we study the generalized Fibonacci like sequences { 𝑡 𝑘,𝑛 } 𝑘 ∈{ 2 , 3 } ,𝑛 ∈ N with arbitrary initial seed and give some new and well- known identities like Binet’s formula, trace sequence, Catalan’s identity, generating function, etc. Further, we study various properties of these generalized sequences, establish a recursive matrix and relationships with Fibonacci and Lucas numbers and sequence of Fibonacci traces. In this study, we exam-ine the nature of identities and recursive matrices for arbitrary initial values.\",\"PeriodicalId\":43454,\"journal\":{\"name\":\"Annales Mathematicae et Informaticae\",\"volume\":\"54 1\",\"pages\":\"\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annales Mathematicae et Informaticae\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33039/ami.2023.05.001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Mathematicae et Informaticae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33039/ami.2023.05.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

. 本文研究了具有任意初始种子的广义类Fibonacci序列{𝑡𝑘,𝑛}𝑘∈{2,3},𝑛∈N,并给出了一些新的已知的恒等式,如Binet公式、迹序列、Catalan恒等式、生成函数等。进一步,我们研究了这些广义序列的各种性质,建立了递归矩阵及其与斐波那契数、卢卡斯数和斐波那契迹序列的关系。在本研究中,我们研究了任意初值的恒等式和递归矩阵的性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the generalized Fibonacci like sequences and matrices
. In this paper, we study the generalized Fibonacci like sequences { 𝑡 𝑘,𝑛 } 𝑘 ∈{ 2 , 3 } ,𝑛 ∈ N with arbitrary initial seed and give some new and well- known identities like Binet’s formula, trace sequence, Catalan’s identity, generating function, etc. Further, we study various properties of these generalized sequences, establish a recursive matrix and relationships with Fibonacci and Lucas numbers and sequence of Fibonacci traces. In this study, we exam-ine the nature of identities and recursive matrices for arbitrary initial values.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
0
期刊最新文献
Using irreducible polynomials for random number generation Solving Hungarian natural language processing tasks with multilingual generative models Stability condition of multiclass classical retrials: a revised regenerative proof Sensitivity analysis of a single server finite-source retrial queueing system with two-way communication and catastrophic breakdown using simulation On the generalized Fibonacci like sequences and matrices
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1